树状数组和线段树

Sat, 11 Apr 2026 00:00:00 +0800

树状数组模板

n,m = map(int,input().split())
t = list(map(int,input().split()))
c = [0] * (n+1)

def lowbit(x):
    return x & (-x)

def add(idx,d):
    while idx <= n:
        c[idx] += d
        idx += lowbit(idx)

    
def query(idx):
    res = 0
    while idx > 0:
        res += c[idx]
        idx -= lowbit(idx)
    return res

def rs(l,r):
    return query(r) - query(l)


for i,v in enumerate(t, start = 1):
    add(i,v)

for i in range(m):
    k,a,b = map(int,input().split())
    if k == 0:
        print(rs(a-1,b)) #注意需要包含第a个元素
    else:
        add(a,b)

操作	普通数组	前缀和数组	树状数组
单点更新	O(1)	O(n)	O(log n)
区间查询	O(n)	O(1)	O(log n)

区间和 on zcys univ II Hugo ver

树状数组和线段树

树状数组模板