Code



f=[0 for i in range(500005)]

def lowbit(x):

    return x&(-x)

def add(x, n, k):

    while x<=n :

        f[x]+=k

        x+=lowbit(x)

def ask(x):

    Res=0

    while x>0:

        Res+=f[x]

        x-=lowbit(x)

    return Res

s=input().split()

n=int(s[0])

m=int(s[1])

s=input().split()

for i in range(1,n+1):

    add(i, n, int(s[i-1]))

while m>0:

    s=input().split()

    op=int(s[0])

    x=int(s[1])

    y=int(s[2])

    if op==1:

        add(x, n, y)

    else:

        print(ask(y)-ask(x-1))

    m=m-1

巴特西

PY个树状数组

Code

最新文章

热门文章