树状数组（Binary Indexed Tree），看这一篇就够了

定义 根据维基百科的定义：java A Fenwick tree or binary indexed tree is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.web 也就是说，所谓树状数组，或称Binary Indexed Tree,

>>阅读原文<<