Cod sursa(job #1968734)

Utilizator Horia14Horia Banciu Horia14 Data 17 aprilie 2017 20:24:11
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.37 kb
#include<cstdio>
#define N_MAX 100000
using namespace std;

int aib[N_MAX+1], n, m;

void updateAIB(int val, int x)
{
    do
    {
        aib[x] += val;
        x += x&-x;
    }while(x <= n);
}

int suma(int x)
{
    int s = 0;
    while(x)
    {
        s += aib[x];
        x &= x-1;
    }
    return s;
}

int Bsearch(int x)
{
    int left, right, mid, sum;
    left = 1; right = n;
    while(left <= right)
    {
        mid = (left+right)/2;
        sum = suma(mid);
        if(sum == x)
            return mid;
        else if(sum < x) left = mid + 1;
        else right = mid - 1;
    }
    return -1;
}

int main()
{
    int op, a, b, i;
    FILE *fin, *fout;
    fin = fopen("aib.in","r");
    fout = fopen("aib.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=n; i++)
    {
        fscanf(fin,"%d",&a);
        updateAIB(a,i);
    }
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d",&op);
        if(op == 0)
        {
            fscanf(fin,"%d%d",&a,&b);
            updateAIB(b,a);
        }
        if(op == 1)
        {
            fscanf(fin,"%d%d",&a,&b);
            fprintf(fout,"%d\n",suma(b)-suma(a-1));
        }
        if(op == 2)
        {
            fscanf(fin,"%d",&a);
            fprintf(fout,"%d\n",Bsearch(a));
        }
    }
    fclose(fin);
    fclose(fout);
    return 0;
}