Pagini recente » Cod sursa (job #333333) | Cod sursa (job #2055585) | Cod sursa (job #2227430) | Cod sursa (job #795232) | Cod sursa (job #1741746)
#include <cstdio>
using namespace std;
const int MAXN = 15000;
int aib[MAXN + 5];
void update(int a, int b, int n){
for (; a <= n; a += a & -a)
aib[a] += b;
}
int query(int a){
int s = 0;
for (; a; a -= a & -a)
s += aib[a];
return s;
}
int main(){
freopen("datorii.in", "r", stdin);
freopen("datorii.out", "w", stdout);
int n, m, i, op, p, q;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i ++){
scanf("%d", &p);
update(i, p, n);
}
for (i = 1; i <= m; i ++){
scanf("%d%d%d", &op, &p, &q);
if (op == 0)
update(p, -q, n);
else
printf("%d\n", query(q) - query(p - 1));
}
return 0;
}