Cod sursa(job #1346993)

Utilizator vladdy47Bucur Vlad Andrei vladdy47 Data 18 februarie 2015 18:41:30
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.28 kb
# include <cstdio>
# define ub(x) (x&(-x))


using namespace std;

int n, NRIS, INSTR;
int aib[100010];
inline void update (int x, int i)
{
    int k;
    for (k = i; k <= n; k+=ub(k))
        aib[k] += x;
}

inline int suma (int x)
{
    int k, rez = 0;
    for (k = x; k > 0; k-=ub(k))
        rez += aib[k];

    return rez;
}

inline int cautbin (int x)
{
    int st = 1 , dr = n;
    int mij;
    while ( st <= dr )
    {
        mij = (st + dr) / 2;
        if (x == suma(mij) ) return mij;
        else if (x > suma(mij)) st = mij+1;
        else  dr = mij-1;
    }
    return -1;
}

int main ()

{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);

    scanf("%d%d",&n,&NRIS);

    int i,x,y;

    for (i = 1; i <= n; i++){
        scanf("%d",&x);
        update(x,i);
    }

    for (i = 1; i <= NRIS; i++)
    {
        scanf("%d",&INSTR);

        if (INSTR == 0)
        {
            scanf("%d%d",&x,&y);
            update(y,x);
        }

        if (INSTR == 1)
        {
            scanf("%d%d",&x,&y);
            printf("%d\n",suma(y) - suma (x-1) );
        }

        if (INSTR == 2)
        {
            scanf("%d",&x);
            printf("%d\n",cautbin(x));

        }
    }

    return 0;
}