Cod sursa(job #3265278)

Utilizator Dia3141Costea Diana Stefania Dia3141 Data 28 decembrie 2024 16:51:02
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>
#define dim (int)(1e5+1)
using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");
int n,m,task,aib[dim],x,y;
void update(int p,int x){
    for(;p<=n;p+=(-p)&p)
        aib[p]+=x;
}
int query(int p){
    int r=0;
    for(;p>0;p-=(-p)&p)
        r+=aib[p];
    return r;
}
int cb(int k){
    int st=1,dr=n,r=-1;
    while(st<=dr){
        int mid=(st+dr)/2,sum=query(mid);
        if(sum==k)
            r=mid,dr=mid-1;
        else if(sum<k)
            st=mid+1;
        else
            dr=mid-1;
    }
    return r;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>x;
        update(i,x);
    }
    while(m--){
        cin>>task>>x;
        if(task==0){
            cin>>y;
            update(x,y);
        }else if(task==1){
            cin>>y;
            cout<<query(y)-query(x-1)<<'\n';
        }else
            cout<<cb(x)<<'\n';
    }
    return 0;
}