Cod sursa(job #1052840)

Utilizator horatiu11Ilie Ovidiu Horatiu horatiu11 Data 11 decembrie 2013 20:49:52
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.09 kb
# include <cstdio>
# define LSB(x) ((-x) & x)
# define nmax 100001
using namespace std;
int n,m,p,v,p1,p2,s,aib[nmax],x;
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 i=1,j=n,m,x;
    while(i<=j)
    {
        m=(i+j)>>1;
        x=sum(m);
        if(x==val)return m;
        else if(x>val)j=m-1;
            else i=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",&x);
        switch(x)
        {
            case 0:scanf("%d%d",&p,&v);update(v,p);break;
            case 1:scanf("%d%d",&p1,&p2);printf("%d\n",sum(p2)-sum(p1-1));break;
            case 2:scanf("%d",&s);printf("%d\n",caut_bin(s));break;
        }
    }
    return 0;
}