Pagini recente » Cod sursa (job #1483236) | Cod sursa (job #1194198) | Cod sursa (job #2907403) | Cod sursa (job #1029426) | Cod sursa (job #2331474)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int a[100001],n,m;
int op,r,b,x;
void op0(int i,int x)
{
while(i<=n){
a[i]+=x;
i=i+(i&(-i));
}
}
int suma(int i){
int sol=0;
while(i>0){
sol+=a[i];
i=i-(i&(-i));
}
return sol;
}
int op1(int val)
{
int i, step;
for (step = 1; step <= n; step <<= 1);
for (i = 1; step; step >>= 1)
if (i + step <=n && suma(i + step) <= val)
i += step;
if(suma(i)==val) return i;
else return -1;
}
int op2(int a, int b){
int r=suma(b)-suma(a-1);
return r;
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++){f>>x; op0(i,x);}
for(int i=1;i<=m;i++){
f>>op;
if(op==0){
f>>r>>b; op0(r,b);
}
if(op==2)
{f>>r; g<<op1(r)<<endl;}
if(op==1) {f>>r>>b; g<<op2(r,b)<<endl;}
}
return 0;
}