Cod sursa(job #3265361)

Utilizator TeodorG8Cirstov Teodor TeodorG8 Data 29 decembrie 2024 18:36:07
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>

using namespace std;

ifstream cin("aib.in");
ofstream cout("aib.out");

int n,m,a,b,c,aib[100005];
void update(int p, int k)
{
    for(; p<=n; p+=(p&-p))
        aib[p]+=k;
}

int query(int p)
{
    long long sum=0;
    for(; p>=1 ; p-=(p&-p))
        sum+=aib[p];
    return sum;
}


int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        {
            cin>>a;
            update(i,a);
        }
    for(int i=1; i<=m; i++)
    {
        cin>>c;
        if(c==0)
        {
            cin>>a>>b;
            update(a,b);
        }
        else if(c==1)
        {
            cin>>a>>b;
            cout<<query(b)-query(a-1)<<"\n";
        }
        else
        {
            cin>>a;
            int pozitie=1;
            while(query(pozitie)<=a && pozitie<=n)
                pozitie++;
            cout<<pozitie-1<<"\n";
        }
    }
}