python 简易版本树状数组

最新推荐文章于 2023-07-07 00:21:19 发布

mxsx4912

最新推荐文章于 2023-07-07 00:21:19 发布

阅读量154

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/mxsx4912/article/details/110352396

版权

python

算法专栏收录该内容

6 篇文章 0 订阅

订阅专栏

class BIT:
    def __init__(self, n: int):
        self.n = n+1
        self.c = [0]*(self.n)

    def update(self, i: int, di: int) -> None:
        diff = di
        i += 1
        while i<self.n:
            self.c[i] += diff
            i += i&(-i)


    def sumRange(self, i: int, j: int) -> int:
        res1 = 0
        res2 = 0
        i = i-1+1
        while i>0:
            res1 += self.c[i]
            i -= i&(-i)
        j += 1
        while j>0:
            res2 += self.c[j]
            j -= j&(-j)       
        return res2 - res1