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