Pagini recente » Cod sursa (job #2775316) | Cod sursa (job #1915850) | Monitorul de evaluare | Cod sursa (job #3164166) | Cod sursa (job #1487390)
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef const int ci;
vi v(16000000);
int poz, val, a, b;
int suma;
void add(ci& nod, ci& left, ci& right){
if (left == right){
v[nod] += val;
return;
}
int mij = (left + right) / 2;
if (poz <= mij)
add(2 * nod, left, mij);
else
add(2 * nod + 1, mij + 1, right);
v[nod] = v[2 * nod] + v[2 * nod + 1];
}
void sum(ci& nod, ci& left, ci& right){
if (left >= a and right <= b){
suma += v[nod];
return;
}
int mij = (left + right) / 2;
int s = 0;
if (a <= mij)
sum(2 * nod, left, mij);
if (mij < b)
sum(2 * nod + 1, mij + 1, right);
}
int main(int argc, const char * argv[]) {
//freopen("/Users/macbookproritena/Documents/xcode projects/c++/datorii/datorii/datorii.in", "r", stdin);
freopen("datorii.in", "r", stdin);
freopen("datorii.out", "w", stdout);
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> val;
poz = i;
add(1, 1, n);
}
int x;
while (m--){
cin >> x >> a >> b;
if (x){
suma = 0;
sum(1, 1, n);
cout << suma << '\n';
}
else{
poz = a;
val = -b;
add(1, 1, n);
}
}
return 0;
}