Cod sursa(job #3361077)

Utilizator ililogIlinca ililog Data 20 iulie 2026 10:42:44
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.45 kb
using namespace std;
#include<bits/stdc++.h>
#define NMAX 100001
int n, m;
int a[NMAX];
int aib[NMAX];

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

int ub(int x) {
    return (x&(-x));
}

void add(int poz, int val) {
    for (int i = poz; i<=n; i+=ub(i)) {
        aib[i] += val;
    }
}

int suma(int poz) { //suma de la 1 la poz
    int ans = 0;
    for (int i = poz; i>=1; i-=ub(i)) {
        ans += aib[i];
    }
    return ans;
}

int main() {
    
    fin >> n >> m;
    for (int i = 1; i<=n; i++) {
        fin >> a[i];
        add(i, a[i]);
    }

    while(m--) {
        int op, a, b;
        fin >> op >> a;
        if (op == 0) {
            fin >> b;
            add(a, b);
        } else if (op == 1) {
            fin >> b;
            fout << suma(b) - suma(a-1) << '\n';
        } else {

            int st = 1, dr = n;
            int pozmin = n+1;
            while(st <= dr) {
                int mid = (st+dr)/2;
                int s = suma(mid);
                if (s < a) {
                    st = mid+1;
                } else if (s > a) {
                    dr = mid-1;
                } else {
                    pozmin = min(pozmin, mid);
                    dr = mid-1;
                }
            }
            if (pozmin != n+1) {
                fout << pozmin << '\n';
            } else {
                fout << "-1\n";
            }
        }
    }
    
    return 0;
}