Pagini recente » Cod sursa (job #3265572) | Clasament simulare-oni-2014 | Cod sursa (job #1698365) | Cod sursa (job #1378146) | Cod sursa (job #2904594)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int a[15005], n, q, c, x, y;
int query(int ii) {
int val = 0;
for(int i = ii; i > 0; i -= (i & -i)) {
val += a[i];
}
return val;
}
void update(int ii, int val) {
for(int i = ii; i <= n; i += (i & -i)) {
a[i] += val;
}
}
int main() {
f >> n >> q;
for(int i = 1; i <= n; i++) {
f >> x;
update(i, x);
}
for(int i = 1; i <= q; i++) {
f >> c >> x >> y;
if(c == 0) {
update(x, -y);
} else {
g << (query(y) - query(x - 1)) << "\n";
}
}
return 0;
}