Cod sursa(job #2737142)

Utilizator Cojocaru_Andrei_CristianCojocaru Andrei Cristian Cojocaru_Andrei_Cristian Data 4 aprilie 2021 14:34:10
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.19 kb
#include <iostream>
#include <fstream>

using namespace std;

int aib[100005];

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

int querry(int p)
{
    int s=0;
    while(p>0)
    {
        s+=aib[p];
        p-=(p&(-p));
    }
    return s;
}

int verif(int val,int n)
{
    int st=1,dr=n,mij,last=-1;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        int temp=querry(mij);
        if(temp>=val)
        {
            if(temp==val)
                last=mij;
            dr=mij-1;
        }
        else
            st=mij+1;
    }
    return last;
}

int main()
{
    int x,y,t,m,n;
    ifstream cin("aib.in");
    ofstream cout("aib.out");
    cin>>n>>m;
    for(int i=1;i<=n;++i)
    {
        cin>>x;
        update(i,x,n);
    }
    while(m--)
    {
        cin>>t;
        if(t==2)
        {
            cin>>x;
            cout<<verif(x,n)<<"\n";
        }
        else
        {
            cin>>x>>y;
            if(t==1)
                cout<<querry(y)-querry(x-1)<<"\n";
            else
                update(x,y,n);
        }
    }
    return 0;
}