Pagini recente » Cod sursa (job #1806662) | Cod sursa (job #799935) | Cod sursa (job #688929) | Cod sursa (job #1813456) | Cod sursa (job #2636457)
#include <fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int aib[100005], n, m, t, a, b;
void update(int poz, int val) {
for(int i = poz; i <= n; i+= (i&(-i)))
aib[i] += val;
}
int query(int poz) {
int sum = 0;
for(int i = poz; i; i -= (i&(-i)))
sum += aib[i];
return sum;
}
int cb(int a) {
int st = 1, dr = n;
while(st <= dr) {
int mij = (st+dr)/2;
int q = query(mij);
if(q == a && query(mij-1) < a) return mij;
else if(q >= a) dr = mij-1;
else st = mij+1;
}
return -1;
}
void citire() {
fin >> n >> m;
for(int i = 1; i <= n; i++) {
int x;
fin >> x;
update(i, x);
}
}
void solve() {
while(m--) {
fin >> t;
if(t == 0) {
fin >> a >> b;
update(a, b);
} else if(t == 1) {
fin >> a >> b;
fout << query(b)-query(a-1) << '\n';
} else {
fin >> a;
fout << cb(a) << '\n';
}
}
}
int main() {
citire();
solve();
}