Pagini recente » Cod sursa (job #1076324) | Cod sursa (job #28355) | Cod sursa (job #1599342) | Cod sursa (job #1802587) | Cod sursa (job #2672178)
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
const int NMAX = 15001;
int n, m;
int aib[NMAX], v[NMAX + 1];
void update(int x, int y);
int query(int x);
int main() {
int x, y, type;
fin >> n >> m;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
update(i, v[i]);
}
for (int i = 1; i <= m; ++i) {
fin >> type >> x >> y;
if (type == 0)
update(x, -y);
else
fout << query(y) - query(x - 1) << "\n";
}
}
void update(int x, int y) {
for (int i = x; i <= n; i += i & (-i))
aib[i] += y;
}
int query(int x) {
int s = 0;
for (int i = x; i >= 1; i -= i & (-i))
s += aib[i];
return s;
}