基于树状数组实现

解题思路:
树状数组
注意事项:
输入要快读
参考代码:

import sys
n, m = map(int, input().split())
a = [0 for _ in range(n + 1)]
tr = [0 for _ in range(n + 1)]


def lowbit(x):
   return x & -x


def add(x, v):
   while x <= n:
       tr[x] += v
       x += lowbit(x)


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


for _ in range(m):
   f, a, b = map(int, sys.stdin.readline().split())
   if f == 0:
       add(a, b)
   else:
       print(query(b) - query(a - 1))