Pagini recente » Cod sursa (job #1456494) | Cod sursa (job #2599943) | Cod sursa (job #2324480) | Cod sursa (job #2291042) | Cod sursa (job #2181265)
#include <iostream>
#include <fstream>
using namespace std;
int main() {
int n, m, A[15005], v1, v2, s, y;
ifstream f("datorii.in");
ofstream g("datorii.out");
f >> n >> m;
for (int i = 1; i <= n; i++)
f >> A[i];
for (int k = 1; k <=m; k++)
{
f >> s >> v1 >> v2 ;
switch (s) {
case 0: {
A[v1] -= v2;
break;
}
case 1: {
y = 0;
for (int i = v1; i <= v2; i++)
y += A[i];
g << y << endl;
break;
}
}
}
return 0;
}