Cod sursa(job #2685353)

Utilizator pregoliStana Andrei pregoli Data 16 decembrie 2020 18:20:46
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.18 kb
#include <bits/stdc++.h>
#define newline '\n'
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
///************************
#define zeros(p) (p & -p)
const int NMAX = 1e5 + 3;
int n, m, aib[NMAX];

void add(int p, int x) {
    while (p <= n) {
        aib[p] += x;
        p += zeros(p);
    }
}

int query(int p) {
    int sum = 0;
    while (p > 0) {
        sum += aib[p];
        p -= zeros(p);
    }
    return sum;
}

int bsrc(int sum) {
    int l = 1, r = n;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (query(mid) == sum)
            return mid;
        if (query(mid) < sum)
            l = mid + 1;
        else
            r = mid - 1;
    }
    return -1;
}

int main() {
    fin >> n >> m;
    for (int x, i = 1; i <= n; i++) {
        fin >> x;
        add(i, x);
    }
    while (m--) {
        int op, a, b;
        fin >> op >> a;
        if (op == 2) {
            fout << bsrc(a) << newline;
            continue;
        }
        fin >> b;
        if (!op)
            add(a, b);
        else
            fout << query(b) - query(a - 1) << newline;
    }
    fout.close();
    return 0;
}