Cod sursa(job #1856449)

Utilizator eduardturtoiEduard Turtoi eduardturtoi Data 24 ianuarie 2017 21:32:13
Problema Arbori indexati binar Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 1.36 kb
#include <fstream>
#include <cstdio>
#define nmax 100001
#define zero(x) ((x ^ (x - 1)) & x)
using namespace std;
FILE*fin=fopen("aib.in","r");
ofstream fout("aib.out");
int aib[nmax],n;

void adauga(int poz,int nr)
{
    int i;
    for(i=poz;i<=n;i+=zero(i))
        aib[i]+=nr;
}

int calculeaza(int poz)
{
    int i,sum=0;
    for(i=poz;i>0;i-=zero(i))
        sum+=aib[i];
    return sum;
}

int cbin(int st,int dr,int val)
{
    int mij=(st+dr)/2;
    if(val==calculeaza(mij))
        return mij;
    else
    {
        if(st<dr)
        {
            if(val<calculeaza(mij))
                cbin(st,mij-1,val);
            else
                cbin(mij+1,dr,val);
        }
        else
            return -1;
    }
}

int main()
{
    int i,m,nr,op,poz,st,dr;
    fscanf(fin,"%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        fscanf(fin,"%d",&nr);
        adauga(i,nr);
    }
    for(i=1;i<=m;i++)
    {
        fscanf(fin,"%d",&op);
        if(op==0)
        {
            fscanf(fin,"%d%d",&poz,&nr);
            adauga(poz,nr);
        }
        if(op==1)
        {
            fscanf(fin,"%d%d",&st,&dr);
            fout<<calculeaza(dr)-calculeaza(st-1)<<'\n';
        }
        if(op==2)
        {
            fscanf(fin,"%d",&nr);
            fout<<cbin(1,n,nr)<<'\n';
        }
    }
    return 0;
}