#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int n, m, t, x, y;
int c[2000010];
int lowbit(int x){
return x & (-x);
}
void add(int i, int k){
while(i <= n){
c[i] += k;
i += lowbit(i);
}
}
int sum(int i){
int ans = 0;
while(i > 0){
ans += c[i];
i -= lowbit(i);
}
return ans;
}
int main(){
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++){
int a;
scanf("%d", &a);
add(i, a);
}
for(int i = 1; i <= m; i++){
scanf("%d%d%d", &t, &x, &y);
if(t == 1){
add(x, y);
}
else{
printf("%d\n", sum(y) - sum(x - 1));
}
}
return 0;
}
04-13
672
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-23