Cod sursa(job #1222533)

Utilizator horatiu11Ilie Ovidiu Horatiu horatiu11 Data 23 august 2014 15:28:48
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.26 kb
//horatiu11
# include <cstdio>
# define nmax 100001
# define LSB(x) ((-x)&x)
using namespace std;
int n,m,AIB[nmax],x,op,a,b,poz,val;
inline void update(int val, int poz)
{
    int i;
    for(i=poz;i<=n;i+=LSB(i))
        AIB[i]+=val;
}
inline int sum(int poz)
{
    int i,s=0;
    for(i=poz;i>0;i-=LSB(i))
        s+=AIB[i];
    return s;
}
inline int caut_bin(int val)
{
    int l=1,r=n,m,s;
    while(l<=r)
    {
        m=(l+r)/2;
        s=sum(m);
        if(s==val)return m;
        else if(s>val)r=m-1;
        else l=m+1;
    }
    return -1;
}
int main()
{
    int i;
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&x);
        update(x,i);
    }
    for(i=1;i<=m;++i)
    {
        scanf("%d",&op);
        switch(op)
        {
            case 0:
                scanf("%d%d",&poz,&val);
                update(val,poz);
                break;
            case 1:
                scanf("%d%d",&a,&b);
                printf("%d\n",sum(b)-sum(a-1));
                break;
            case 2:
                scanf("%d",&val);
                printf("%d\n",caut_bin(val));
                break;
        }
    }
    return 0;
}