Cod sursa(job #759158)

Utilizator test13test13 test13 Data 16 iunie 2012 22:47:07
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#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;
}