Pagini recente » Cod sursa (job #389435) | Cod sursa (job #1936731) | Cod sursa (job #1899409) | Cod sursa (job #2785342) | Cod sursa (job #739693)
Cod sursa(job #739693)
#include <cstdio>
#define MAX 100001
int V[MAX],n,m;
void update(int idx,int val){
while(idx<=n){
V[idx]+=val;
idx+=idx&-idx;
}
}
int read(int idx){
int sum=0;
while(idx>0){
sum+=V[idx];
idx-=idx&-idx;
}
return sum;
}
int CB(int x){
int st,dr,md,sum;
st=1; dr=n;
while(dr-st>1){
md=(st+dr)/2;
sum=read(md);
if(sum>x)dr=md-1; else st=md; }
return read(st)==x?st:read(dr)==x?dr:-1;
}
int main(){
int cod,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); }
for(int i=1;i<=m;i++){
scanf("%d",&cod);
switch(cod){
case 0: scanf("%d %d",&x,&y); update(x,y); break;
case 1: scanf("%d %d",&x,&y);
printf("%d\n",read(y)-read(x-1)); break;
case 2: scanf("%d",&x); printf("%d\n",CB(x)); break; }
}
}