{"blog_url":"https://inarizuuuushi.hatenablog.com/","version":"1.0","blog_title":"Sabrou-mal \u30b5\u30d6\u30ed\u30a6\u4e38","description":"I show the RangeMinimumQuery, RangeMaximumQuery and BitIndexTree python class implementations. RangeMinimumQuery and RangeMaximumQuery are data structures for faster obtaining the minimum and maximum value of sub sequential array. BitIndexTree is a data structure for faster obtaining the summation o\u2026","author_name":"inarizuuuushi","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finarizuuuushi.hatenablog.com%2Fentry%2F2022%2F11%2F07%2F090000\" title=\"RangeMinimumQuery, RangeMaximumQuery, BitIndexTree coded by Python - Sabrou-mal \u30b5\u30d6\u30ed\u30a6\u4e38\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_url":"https://hatena.blog","title":"RangeMinimumQuery, RangeMaximumQuery, BitIndexTree coded by Python","published":"2022-11-07 09:00:00","provider_name":"Hatena Blog","categories":[" python ","\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u5468\u8fba"],"width":"100%","image_url":null,"type":"rich","url":"https://inarizuuuushi.hatenablog.com/entry/2022/11/07/090000","height":"190","author_url":"https://blog.hatena.ne.jp/inarizuuuushi/"}