Cod sursa(job #1939321)

Utilizator nicu_serteSerte Nicu nicu_serte Data 25 martie 2017 16:52:16
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.19 kb
#include <fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int n, m, aib[100001];
#define pas(x) ((-x)&x)
void update(int poz, int val)
{
    int i;
    for(i=poz; i<=n; i+=pas(i))
        aib[i]+=val;
}
int suma(int poz)
{
    int i, s=0;
    for(i=poz; i>=1; i-=pas(i))
        s+=aib[i];
    return s;
}
int sumaInterval(int x, int y)
{
    return suma(y)-suma(x-1);
}
int cautare(int a)
{
    int m, st, dr, s;
    st=1; dr=n;
    while(st<=dr)
    {
        m=(st+dr)/2;
        s=sumaInterval(1, m);
        if(s==a)
            return m;
        else if(s<a)
            st=m+1;
        else dr=m-1;
    }
    return -1;
}
int main()
{
    int op, x, y, i;
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        fin>>x;
        update(i, x);
    }
    for(i=1; i<=m; i++)
    {
        fin>>op;
        if(op==0)
        {
            fin>>x>>y;
            update(x, y);
        }
        else if(op==1)
        {
            fin>>x>>y;
            fout<<sumaInterval(x, y)<<'\n';
        }
        else if(op==2)
        {
            fin>>x;
            fout<<cautare(x)<<'\n';
        }
    }
    return 0;
}