Pagini recente » Cod sursa (job #1413928) | Cod sursa (job #757893) | Cod sursa (job #347708) | Cod sursa (job #2359468) | Cod sursa (job #954157)
Cod sursa(job #954157)
#include<cstdio>
using namespace std;
int n,m,i,poz,val,a,b,arb[(1<<17)+5],op;
void add(int poz,int val)
{
for(int i=poz;i<=n;i+=i&(-i)) arb[i]+=val;
}
int sum(int x)
{
int s=0,i;
for(i=x;i;i-=i&(-i)) s+=arb[i];
return s;
}
int query(int x)
{
int l=1,r=n,m,val;
while(l<=r)
{
m=(l+r)/2; val=sum(m);
if(val==x) return m;
if(val<x) l=m+1;
else r=m-1;
}
return -1;
}
int main()
{
freopen("aib.in","r",stdin);
freopen("aib.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d",&val);
add(i,val);
}
for(;m;m--)
{
scanf("%d",&op);
if(op==0)
{
scanf("%d%d",&poz,&val);
add(poz,val);
continue;
}
if(op==1)
{
scanf("%d%d",&a,&b);
printf("%d\n",sum(b)-sum(a-1));
continue;
}
scanf("%d",&a);
printf("%d\n",query(a));
}
return 0;
}