{"description":"\u5727\u7e2e\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u306b\u304a\u3051\u308b\u9069\u5fdc\u578b\u7b97\u8853\u7b26\u53f7\u306e\u5b9f\u88c5\u3067\u306f\u3001\u7d2f\u7a4d\u983b\u5ea6\u8868\u3092\u52b9\u7387\u7684\u306b\u66f4\u65b0\u3067\u304d\u308b\u30c7\u30fc\u30bf\u69cb\u9020\u304c\u5fc5\u8981\u306b\u306a\u308a\u307e\u3059\u3002\u3082\u3068\u3082\u3068\u7b97\u8853\u7b26\u53f7\u3092\u5b9f\u88c5\u3059\u308b\u306b\u306f\u7d2f\u7a4d\u983b\u5ea6\u8868\u304c\u5fc5\u8981\u306a\u306e\u3067\u3059\u304c\u3001\u3053\u308c\u304c\u9069\u5fdc\u578b\u306b\u306a\u308b\u3068\u3001\u8a18\u53f7\u5217\u3092\u5148\u982d\u304b\u3089\u7b26\u53f7\u5316\u3057\u306a\u304c\u3089\u3001\u3059\u3067\u306b\u898b\u305f\u8a18\u53f7\u306e\u7d2f\u7a4d\u983b\u5ea6\u3092\u66f4\u65b0\u3057\u3066\u3044\u304f\u5fc5\u8981\u304c\u3042\u308b\u305f\u3081\u3067\u3059\u3002\u7d2f\u7a4d\u5ea6\u6570\u8868\u3092\u30ca\u30a4\u30fc\u30d6\u306b\u5b9f\u88c5\u3059\u308b\u3068\u3001\u66f4\u65b0\u306b\u306f O(n) \u304b\u304b\u3063\u3066\u3057\u307e\u3044\u307e\u3059\u3002\u914d\u5217\u3067\u8868\u3092\u6301\u3063\u3066\u3044\u305f\u5834\u5408\u3001\u9069\u5f53\u306a\u8981\u7d20\u306e\u983b\u5ea6\u306b\u66f4\u65b0\u304c\u304b\u304b\u308b\u3068\u305d\u306e\u8981\u7d20\u3088\u308a\u3082\u524d\u306e\u8981\u7d20\u3059\u3079\u3066\u3092\u66f4\u65b0\u3059\u308b\u5fc5\u8981\u304c\u3042\u308a\u307e\u3059\u3002\u9069\u5fdc\u578b\u7b97\u8853\u7b26\u53f7\u306e\u3088\u3046\u306b\u8a18\u53f7\u3092\u7b26\u53f7\u5316\u3059\u308b\u5ea6\u306b\u66f4\u65b0\u304c\u304b\u304b\u308b\u30b1\u30fc\u30b9\u306b\u306f\u5411\u3044\u3066\u3044\u307e\u305b\u3093\u3002Binary Indexed Tree (BIT, P.\u2026","image_url":null,"categories":[],"type":"rich","version":"1.0","url":"https://naoya-2.hatenadiary.org/entry/20090606/1244284915","provider_url":"https://hatena.blog","height":"190","published":"2009-06-06 19:41:55","blog_url":"https://naoya-2.hatenadiary.org/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fnaoya-2.hatenadiary.org%2Fentry%2F20090606%2F1244284915\" title=\" Binary Indexed Tree (Fenwick Tree) - naoya\u306e\u306f\u3066\u306a\u30c0\u30a4\u30a2\u30ea\u30fc\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","blog_title":"naoya\u306e\u306f\u3066\u306a\u30c0\u30a4\u30a2\u30ea\u30fc","author_name":"naoya","author_url":"https://blog.hatena.ne.jp/naoya/","width":"100%","title":" Binary Indexed Tree (Fenwick Tree)"}