Pagini recente » Cod sursa (job #279603) | Cod sursa (job #3188960) | Cod sursa (job #2509431) | Cod sursa (job #2302463) | Cod sursa (job #1435065)
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n, i, j, k, l, m;
int c, s;
int v[15005];
int main() {
fin >> n >> m;
for (i = 1; i <= n; ++i) {
fin >> v[i];
}
for (i = 1; i <= m; ++i) {
fin >> c >> k >> l;
if (c == 0) {
v[k] -= l;
}
else {
s = 0;
for (j = k; j <= l; ++j) {
s += v[j];
}
fout << s << '\n';
}
}
fout.close();
return 0;
}