Cod sursa(job #2131181)

Utilizator alisavaAlin Sava alisava Data 14 februarie 2018 14:46:33
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.42 kb
#include <bits/stdc++.h>
#define pow2(x) ( (x ^ (x - 1)) & x )
using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");
unsigned int aib[100005],s[100005],n,m;
/// 0 1 1 3 1 5 5 7 1 9 9  11 9  13 13 15 1
/// 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

void Citire()
{
    fin>>n>>m;
    for(unsigned int i=1;i<=n;i++)
    {
        fin>>s[i];
        s[i]=s[i-1]+s[i];
        aib[i]=s[i]-s[i-pow2(i)];
    }
}
void Update(int poz,int x)
{
    for(unsigned int i=poz;i<=n;i=i+pow2(i))
        aib[i]+=x;
}
int Query(int x)
{
    unsigned sum=0;
    for(int i=x;i>=1;i=i-pow2(i))
        sum=sum+aib[i];
    return sum;
}

int main()
{
    int x,y,val,p,mij,fn,st;
    Citire();
    for(unsigned int i=1;i<=m;i++)
    {
        fin>>p;
        if(p==0)
        {
            fin>>x>>y;
            Update(x,y);
        }
        else if(p==1)
        {
            fin>>x>>y;
            fout<<Query(y)-Query(x-1)<<"\n";
        }
        else if(p==2)
        {
            fin>>x;
            st=1;
            fn=n;
            while(st<=fn)
            {
                mij=(st+fn)/2;
                val=Query(mij);
                if(val==x)
                {
                    fout<<mij<<"\n";
                    break;
                }
                else if(val<x) st=mij+1;
                else fn=mij-1;
            }
        }

    }


    return 0;
}