Cod sursa(job #2306614)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 22 decembrie 2018 17:27:00
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.9 kb
#include<cstdio>
const int N=100001;
int n,m,y,z,i,j,s,c[N],a[N],x;
int R(int y,int z)
{
    int s=0,t=0;
    for(;z;s+=c[z],z-=(z&(-z)));
    for(y--;y;t+=c[y],y-=(y&(-y)));
    return s-t;
}
int Q(int s,int p)
{
	int i;
    for(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);
    for(s>>=1,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)
                for(;y<=n;c[y]+=z,y+=(y&(-y)));
            else
                printf("%d\n",R(y,z));
        }
    }
}