最短树状数组！！！

不废话

#include<cstdio>
#define lowbit(x) (x&-x)
#define add(x,k)  while(x<=n) sumv[x]+=k,x+=lowbit(x)
#define query(x,a) while(x) a+=sumv[x],x-=lowbit(x)

const int maxn = 500010;
int n, q, x, l, r, ansl, ansr;
int sumv[maxn];

int main() {
    scanf("%d %d", &n, &q);
    for(int i = 1,y;i <= n;i++) {
        scanf("%d", &y);
        int k = i;  add(k,y);
    }

  while(q--) {
      scanf("%d %d %d",&x,&l,&r);
      if(x == 1) add(l,r);
      else {
          l--; ansl = 0; ansr = 0;
          query(l,ansl); query(r,ansr);
          printf("%d\n", ansr-ansl);
        }
    }
    return 0;
}