Cod sursa(job #3159970)

Utilizator Utucora2017Nicolae Utucora2017 Data 22 octombrie 2023 16:46:46
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include<fstream>
using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");
int n,m;
int a[100001],aib[100001];
void update(int poz, int val){
    for(int i=poz;i<=n;i+=i&(-i))
        aib[i]+=val;
}

int query(int poz){
    int s=0;
    for(int i=poz;i>=1;i-=i&(-i))
        s+=aib[i];
    return s;
}
int bns(int x){
    int st=1,dr=n,poz;
    int mid=(st+dr)/2;
    while(st<=dr){
        mid=(st+dr)/2;
        if(query(mid)>=x)
            poz=mid,dr=mid-1;
        else
            st=mid+1;
    }
    return poz;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        update(i,a[i]);
    }
    for(int k=1;k<=m;k++){
        int q;
        cin>>q;
        if(q==0){
            int x,y;
            cin>>x>>y;
            update(x,y);
        }
        else if(q==1){
            int x,y;
            cin>>x>>y;
            cout<<query(y)-query(x-1)<<"\n";
        }
        else{
            int x;
            cin>>x;
            cout<<bns(x)<<"\n";

        }
    }

}