Cod sursa(job #1204637)

Utilizator ArchazeyBaltatu Andrei-Mircea Archazey Data 3 iulie 2014 15:32:59
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.21 kb
#include<fstream>
using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

const int NMAX=100005;

int n,m,a[NMAX],AIB[NMAX];

inline int zeros(int x)
{
    return x&(x^(x-1));
}

inline void Update(int x,int val)
{
    for (int i=x;i<=n;i+=zeros(i))
        AIB[i]+=val;
}

inline void Citire()
{
    int i;
    fin>>n>>m;
    for (i=1;i<=n;i++)
        {
            fin>>a[i];
            Update(i,a[i]);
        }
}

inline int Compute(int x)
{
    int i,rez=0;
    for (i=x;i>0;i-=zeros(i))
        rez+=AIB[i];
    return rez;
}

inline void Cauta(int x)
{
    int st,dr,mij,aux,minim;
    st=1;dr=n;
    while (st<=dr)
        {
            mij=(st+dr)>>1;
            aux=Compute(mij);
            if (aux==x) {minim=mij;dr=mij-1;}
            else if (aux>x) dr=mij-1;
            else st=mij+1;
        }
    fout<<minim<<"\n";
}

inline void SOLVE()
{
    int i,x,y,z;
    for (i=1;i<=m;i++)
        {
            fin>>x>>y;
            if (!x) {fin>>z;Update(y,z);}
            if (x==1) {fin>>z;fout<<Compute(z)-Compute(y-1)<<"\n";}
            if (x==2) Cauta(y);
        }
}

int main()
{
    Citire();
    SOLVE();
    return 0;
}