Cod sursa(job #3266406)

Utilizator mihneatoadergabrielToader Mihnea mihneatoadergabriel Data 8 ianuarie 2025 16:38:21
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <fstream>

using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");
int n,m,aib[100005],a[100005],i;
void update(int p, int val)
{
    for(int i=p; i<=n;i+=(i&-i))
    {
        aib[i]+=val;
    }
}
int query(int p)
{
    int s=0;
    for(int i=p;i>=1;i-=(i&-i))
    {
        s+=aib[i];
    }
    return s;
}
int bs(int st, int dr, int val)
{
    if(st>dr) return -1;
    else
    {
    int m=(st+dr)/2;
    if(a[m]==val) return m;
    else if(a[m]>val) return bs(st,m-1,val);
    else return bs(m+1,dr,val);
    }
}
int main()
{
    cin>>n>>m;
    for(int j=1;j<=n;j++)
    {
        cin>>a[j];
        update(j,a[j]);
    }
    for(int j=1;j<=m;j++)
    {
        int c,x,y;
        cin>>c>>x;
        if(c==0)
        {
        cin>>y;
        update(x,y);
        }
        else if(c==1)
        {
            cin>>y;
            cout<<query(y)-query(x-1)<<'\n';
        }
        else if (c==2)
        {
            cout<<bs(1,n,x)<<'\n';
        }
    }
    return 0;
}