Cod sursa(job #2931958)

Utilizator andiRTanasescu Andrei-Rares andiR Data 1 noiembrie 2022 12:11:06
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.17 kb
#include <iostream>
#include <fstream>

#define Nmax 100000
using namespace std;
ifstream fin ("aib.in");
ofstream fout ("aib.out");
char ch;
int n,m,a,b;
int aib[Nmax+1],v[Nmax+1];

void aib_add(int val, int pos){
    for (int i=pos; i<=n; i+=(i&-i))
        aib[i]+=val;
}
int aib_querry(int l, int r){
    int sl=0, sr=0, i;
    for (i=r; i>0; i-=(i&-i))
        sr+=aib[i];
    for (i=l-1; i>0; i-=(i&-i))
        sl+=aib[i];
    return sr-sl;
}
int aib_search(int val){
    int add=1,l=0;
    while (add<=n)
        add<<=1;
    while (add>0){
        if (l+add<=n && val>=aib[l+add]){
            l+=add;
            val-=aib[l];
            if (val==0)
                return l;
        }
        add>>=1;
    }
    return -1;
}
int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++){
        fin>>v[i];
        aib_add(v[i], i);
    }
    for (int i=1;i<=m;i++){
        fin>>ch;
        fin>>a;
        if (ch=='0'){
            fin>>b;
            aib_add(b,a);
        }
        else if (ch=='1'){
            fin>>b;
            fout<<aib_querry(a,b)<<'\n';
        }
        else fout<<aib_search(a)<<'\n';
    }
    return 0;
}