Pagini recente » Cod sursa (job #473426) | Cod sursa (job #3225188) | Cod sursa (job #1842001) | Cod sursa (job #2989846) | Cod sursa (job #3221021)
using namespace std;
#include<iostream>
#include<fstream>
ifstream fin("aib.in");
ofstream fout("aib.out");
int n, m;
int v[100001];
int aib[100001];
void add(int poz, int val) {
for (int i = poz; i<=n; i += (i & (-i))) {
aib[i] += val;
}
}
int sum(int poz) {
int s = 0;
for (int i = poz; i>=1; i -= (i & (-i))) {
s += aib[i];
}
return s;
}
int main() {
fin >> n >> m;
for (int i = 1; i<=n; i++) {
fin >> v[i];
add(i, v[i]);
}
for (int i = 1; i<=m; i++) {
int tip;
fin >> tip;
if (tip == 0) {
int poz, val;
fin >> poz >> val;
add(poz, val);
} else if (tip == 1) {
int a, b;
fin >> a >> b;
fout << sum(b) - sum(a-1) << "\n";
} else {
int a, s = 0, poz = 0;
fin >> a;
for (int b = 17; b>=0; b--) {
if (poz + (1<<b) <= n && s + aib[poz + (1<<b)] < a) {
s += aib[poz + (1<<b)];
poz += (1<<b);
}
}
if (poz + 1 > n || sum(poz+1) != a) {
fout << "-1\n";
} else {
fout << poz+1 << "\n";
}
}
}
return 0;
}