Cod sursa(job #767320)

Utilizator test_666013Testez test_666013 Data 13 iulie 2012 12:01:24
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.03 kb
#include <cstdio>

#define MAX 100001

int n,a[MAX];

void update(int idx,int val){
    while( idx <= n )
    {
        a[idx] += val;
        idx += idx & -idx;
    }
}

int read(int idx){
    int sum = 0;
    while( idx > 0 )
    {
        sum += a[idx];
        idx -= idx & -idx;
    }
    return sum;
}

int cbin(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(l) == x ? l : -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",cbin(x));
            }else{
                scanf("%d %d",&x,&y);
                if(c == 0)update(x,y); else printf("%d\n",read(y)-read(x-1));
            }
        }
    return 0;
}