Cod sursa(job #2028101)

Utilizator KOzarmOvidiu Badea KOzarm Data 27 septembrie 2017 10:03:16
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.22 kb
#include <fstream>

using namespace std;

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

int a[100001],n,m,x,y,p;

void adauga(int poz,int val)
{
    while(poz<=n)
    {
        a[poz]+=val;
        poz=poz+(poz&(-poz));
    }
}

int suma(int poz)
{
    int sum=0;
    while(poz>0)
    {
        sum+=a[poz];
        poz=(poz&(poz-1));
    }
    return sum;
}


int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        fin>>x;
        adauga(i,x);
    }
    while(m)
    {
        m--;
        fin>>p;
        if(p==0)
        {
            fin>>x>>y;
            adauga(x,y);
        }
        else
        if(p==1)
        {
            fin>>x>>y;
            fout<<suma(y)-suma(x-1)<<"\n";
        }
        else
        if(p==2)
        {
            fin>>x;
            int i=0;
            while(1)
            {
                i++;
                if(a[i]>x)
                {
                    fout<<"-1\n";
                    break;
                }
                else
                if(a[i]==x)
                {
                    fout<<i<<"\n";
                    break;
                }
            }
        }
    }
    return 0;
}