Cod sursa(job #1138505)

Utilizator OnimushaLordTiberiu Copaciu OnimushaLord Data 10 martie 2014 09:55:16
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.18 kb
# include <cstdio>
# define zero(x) (x&(-x))
# define N 100010

using namespace std;

int a[N],i,n,m;
int poz,val,S,x,y,op;

void update(int poz, int val)
{
    int i;
    for(i=poz; i<=n; i+=zero(i))
        a[i]+=val;
}
int query(int poz)
{
    int i,r=0;
    for(i=poz; i>0; i-=zero(i))
        r+=a[i];
    return r;
}
int bs(int S)
{
    int st,dr,m,sol;
    st=1; dr=n;
    while(st<=dr)
    {
        m=(st+dr)/2;
        sol=query(m);
        if(sol==S) return m;
        if(sol<S) st=m+1;
        else dr=m-1;
    }
    return -1;
}
int main()
{
    freopen("aib.in", "r", stdin);
    freopen("aib.out", "w", stdout);
    scanf("%d %d\n", &n, &m);
    for(i=1; i<=n; ++i)
    {
        scanf("%d ", &x);
        update(i,x);
    }
    for(i=1; i<=m; ++i)
    {
        scanf("%d ", &op);
        if(op==0)
        {
            scanf("%d %d\n", &poz, &val);
            update(poz,val);
        }
        if(op==1)
        {
            scanf("%d %d\n", &x, &y);
            printf("%d\n", query(y)-query(x-1));
        }
        if(op==2)
        {
            scanf("%d\n", &S);
            printf("%d\n", bs(S));
        }
    }
}