Cod sursa(job #3309569)

Utilizator MrPetcuPetcu Robert MrPetcu Data 6 septembrie 2025 14:59:59
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.31 kb
#include <fstream>

using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

int n, m;
int x, y;
int tip;
int aib[100005];

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

int suma(int x, int y) {
    if(x != 1){
        return suma(1, y) - suma(1, x-1);
    }
    int suma_tot = 0;
    while(y > 0) {
        suma_tot += aib[y];
        y -= (y & (-y));
    }
    return suma_tot;
}

int cautare(int x) {
    int suma = 0, p = 1 << 20, r = 0, k = -1;
    while(p > 0) {
        if(r + p <= n && suma + aib[r + p] == x) {
            k = r + p;
        }
        if(r + p <= n && suma + aib[r + p] < x) {
            suma += aib[r + p];
            r += p;
        }
        p /= 2;
    }
    return k;
}

int main(){
    fin >> n >> m;
    for(int i = 1; i <= n; i++) {
        fin >> x;
        adaugare(i, x);
    }
    for(int i = 1; i <= m; i++) {
        fin >> tip;
        if(tip == 0) {
            fin >> x >> y;
            adaugare(x, y);
        }
        else if(tip == 1) {
            fin >> x >> y;
            fout << suma(x, y) << '\n';
        }
        else if(tip == 2) {
            fin >> x;
            fout << cautare(x) << '\n';
        }
    }
    return 0;
}