Cod sursa(job #2525313)

Utilizator nicolaee2Martinescu Nicolae nicolaee2 Data 17 ianuarie 2020 08:45:32
Problema Arbori indexati binar Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.43 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
#define NMAX 100005

int AIB[NMAX];
int n,m;

void update(int AIB[],int n,int index,int val)
{
    while(index<=n)
    {
        AIB[index]+=val;
        index += index & (-index);
    }
}

int getSum(int AIB[],int index)
{
    int sum = 0;
    while(index > 0)
    {
        sum+=AIB[index];
        index -= index & (-index);
    }
    return sum;
}


void afisare()
{
    for(int i=1;i<=n;i++)
    {
        fout<<AIB[i]<<" ";
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        int x;
        fin>>x;
        update(AIB,n,i,x);
    }
    //afisare();
    for(int i=1;i<=m;i++)
    {
        int c,a,b;
        fin>>c;
        //cout<<c<<" "<<a<<" "<<b<<endl;
        if(c==0)
        {
            fin>>a>>b;
            update(AIB,n,a,b);

        }
        else if(c==1)
        {
            fin>>a>>b;
            fout<<getSum(AIB,b)-(getSum(AIB,a-1))<<'\n';
        }
        else
        {
            fin>>a;
            int ok=0;
            for(int i = 1;i<=n;i++)
            {
                int s = getSum(AIB,i);
                if(s == a)
                {
                    ok=1;
                    fout<<i<<'\n';

                }
            }
            if(!ok)
                fout<<-1<<'\n';
        }

    }

}