Pagini recente » Cod sursa (job #2394427) | Cod sursa (job #2627589) | Cod sursa (job #2628102) | Cod sursa (job #436875) | Cod sursa (job #2628111)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int main () {
int n, m, a[15000], op, t, v, p, q, sum;
f >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) {
f >> op;
if (op == 0) {
f >> t >> v;
a[t] = a[t] - v;
} else {
f >> p >> q;
sum = 0;
for (int j = p; j <= q; j++) {
sum += a[j];
}
g << sum << endl;
}
}
}