Cod sursa(job #3246833)

Utilizator luca._.solosluca solos luca._.solos Data 4 octombrie 2024 16:15:07
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.39 kb
#include <iostream>

using namespace std;

int n; int aib[100005];

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

int query(int i)
{
    int ans=0;
    while(i>=1)
    {
        ans+=aib[i];
        i-=i&-i;
    }
    return ans;
}

int main()
{
    int n, q, x, t, a, b;
    cin>>n>>q;
    for(int i=1; i<=n; i++)
    {
        cin>>x;
        upd(i, x);
    }
    for(int i=1; i<=n; i++) cout<<aib[i]<<' ';
    cout<<'\n';
    for(int i=1; i<=q; i++)
    {
        cin>>t;
        if(t==0)
        {
            cin>>a>>b;
            upd(a, b);
        }
        else if(t==1)
        {
            cin>>a>>b;
            cout<<query(b)-query(a-1)<<'\n';
        }
        else
        {
            cin>>x;
            int ans;
            /*int st=1, dr=n+1, md, ans;
            while(st<=dr)
            {
                md=(st+dr)/2;
                if(x>query(md))
                {
                    st=md+1;
                }
                else if(x==query(md))
                {
                    ans=md;
                    break;
                }
                else dr=md;
            }*/
            for(int j=1; j<=n; j++)
            {
                if(query(j)==x)
                    ans=j;
            }
            cout<<ans<<'\n';
        }
    }

    return 0;
}