Pagini recente » Cod sursa (job #1987) | Cod sursa (job #2627407) | Cod sursa (job #2646659) | Cod sursa (job #2719411) | Cod sursa (job #759158)
Cod sursa(job #759158)
#include <cstdio>
#define MAX 100001
int n,arb[MAX];
void update(int idx,int val){
while(idx<=n)
{
arb[idx]+=val;
idx+=idx&-idx;
}
}
int read(int idx){
int sum = 0;
while(idx>0)
{
sum+=arb[idx];
idx-=idx&-idx;
}
return sum;
}
int caut_binar(int x){
int l=1,r=n,m;
while(l<r)
{
m=(l+r)/2;
if(read(m)>=x)r=m; else l=m+1;
}
return read(r)==x?r:-1;
}
int main(){
int m,c,x,y;
freopen("aib.in","r",stdin);
freopen("aib.out","w",stdout);
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
update(i,x);
}
while(m--)
{
scanf("%d",&c);
if(c==2)
{
scanf("%d",&x);
printf("%d\n",caut_binar(x));
} else {
scanf("%d %d",&x,&y);
if(c==0)update(x,y); else printf("%d\n",read(y)-read(x-1));
}
}
return 0;
}