Pagini recente » Cod sursa (job #2140478) | Cod sursa (job #1211829) | Cod sursa (job #1896392) | Cod sursa (job #795618) | Cod sursa (job #2461032)
#include <fstream>
std::ifstream f("datorii.in");
std::ofstream g("datorii.out");
using std::endl;
int main() {
int m, n;
int na[15000];
f >> n >> m;
for (int i = 1; i <= n; i++)
f >> na[i];
int op;
for (int i = 1; i <= m; i++) {
f >> op;
if (op) {
int p, q;
f >> p >> q;
int suma = na[p];
for (int j = p+1; j <= q; j++)
suma += na[j];
g << suma << endl;
}
else {
int t, v;
f >> t >> v;
na[t] -= v;
if (na[t] < 0)
na[t] = 0;
}
}
}