二分索引树(树状数组)
i-Blue
抱平常心走平常路
展开
-
binary indexed tree 二分索引树 树状数组
参考: https://www.byvoid.com/blog/binary-index-tree http://www.cnblogs.com/sixdaycoder/p/4348360.html http://blog.csdn.net/liangzhaoyang1/article/details/51365192 1)求Ci C[i] = A[i-2^k+1]原创 2016-08-19 20:07:34 · 1457 阅读 · 0 评论 -
307. Range Sum Query - Mutable
Tags--binary indexed tree(二分索引树,树状数组)原创 2016-08-19 20:31:39 · 453 阅读 · 0 评论 -
Count of Smaller Numbers After Self
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i]. Example:原创 2016-09-21 22:59:16 · 267 阅读 · 0 评论