Pagini recente » Cod sursa (job #1792332) | Cod sursa (job #2141195) | Cod sursa (job #1335629) | Cod sursa (job #1642249) | Cod sursa (job #2720477)
//#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
int n, m, z[15001];
fin >> n >> m;
for (int i = 1; i <= n; i++)
fin >> z[i];
for (int i = 1; i <= m; i++) {
int x;
fin >> x;
if (x) {
int p, q, s=0;
fin >> p >> q;
while (p<=q) {
s += z[p];
p++;
}
fout << s << endl;
} else {
int t, v;
fin >> t >> v;
z[t] -= v;
}
}
fin.close();
fout.close();
return 0;
}