Cod sursa(job #765382)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 7 iulie 2012 13:36:39
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include<cstdio>
int n,m,y,z,i,j,s,c[100001],a[100001],x;

int R(int y,int z)
{int s=0,t=0;
while(z)
      s+=c[z],z-=(z&(-z));
y--;
while(y)
      t+=c[y],y-=(y&(-y));
return s-t;}

int Q(int s,int p)
{for(int i=0;s;s>>=1)
if(i+s<=n)
      if(c[i+s]<p)
            i+=s,p-=c[i];
      else
            if(c[i+s]==p)
                  return i+s;
return -1;}

int main()
{freopen("aib.in","r",stdin);
freopen("aib.out","w",stdout);
scanf("%d%d",&n,&m);
for(s=1;s<=n;s<<=1);
s>>=1;
for(i=1;i<=n;i++)
     scanf("%d",&a[i]),a[i]+=a[i-1],j=i-(i&(-i)),c[i]=a[i]-a[j];
while(m--)
     {scanf("%d%d",&x,&y);
     if(x==2)
             printf("%d\n",Q(s,y));
     else
             {scanf("%d",&z);
             if(!x)
                     while(y<=n)
                             c[y]+=z,y+=(y&(-y));
             else
                     printf("%d\n",R(y,z));}}
return 0;}