Cod sursa(job #1708326)

Utilizator ionanghelinaIonut Anghelina ionanghelina Data 26 mai 2016 21:42:09
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.33 kb
#include<cstdio>
#define zeros(x) ((x ^ (x - 1) & x))
using namespace std;
int n,AIB[100005],x,m,c,a,b;
void adauga(int val,int poz)
{
    for(int i=poz;i<=n;i+=zeros(i))
    {
        AIB[i]+=val;
    }
}
int suma(int x)
{
    int s=0;
    for(int i=x;i>=1;i-=zeros(i))
    {
        s+=AIB[i];
    }
    return s;
}
int cautare(int x)
{
    int i, step;

        for ( step = 1; step < n; step <<= 1 );
        for( i = 0; step; step >>= 1 )
        {
            if( i + step <= n)
            {
                if(x>= AIB[i+step] )
                {
                    i += step, x-= AIB[i];
                    if (!x) return i;
                }
            }
        }

    return -1;
}
int main()
{
    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);
        adauga(x,i);
    }
    for(int i=1;i<=m;i++)
    {
        scanf("%d",&c);
        if (c==0)
        {
            scanf("%d%d",&a,&b);
            adauga(b,a);
        }
            else
        if (c==1)
        {
            scanf("%d%d",&a,&b);
            printf("%d\n",suma(b)-suma(a-1));
        }
            else
        {
            scanf("%d",&a);
            printf("%d\n",cautare(a));
        }
    }
    return 0;
}