Pagini recente » Cod sursa (job #1831868) | Cod sursa (job #3156297) | Cod sursa (job #2321012) | Cod sursa (job #763519) | Cod sursa (job #2635362)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("datorii.in");
ofstream fout("datorii.out");
#define cin fin
#define cout fout
#define int long long
#define Nmax 15001
int n, q;
int a[Nmax];
void adauga(int i, int val) {
for(; i <= n; i += i & (-i)) {
a[i] += val;
}
}
int calc(int i) {
int sol = 0;
for(; i; i -= i & (-i)) {
sol += a[i];
}
return sol;
}
#define int int
int main() {
cin >> n >> q;
for(int i=1; i <= n; i++) {
int x; cin >> x;
adauga(i, x);
}
while(q--) {
int t, x, y; cin >> t >> x >> y;
if(t) {
cout << calc(y) - calc(x - 1) << endl;
} else {
adauga(x, -y);
}
}
return 0;
}