Cod sursa(job #1583674)

Utilizator linia_intaiConstantinescu Iordache Ciobanu Noi cei din linia intai linia_intai Data 29 ianuarie 2016 10:40:06
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.46 kb
#include <fstream>

#define lsb(x) ((x) & (-(x)))
using namespace std;

const int NMAX = 100005;
const int QMAX = 150005;

int n;
int aib[NMAX];

int query(int pos) {
    int sum = 0;
    for (; pos; pos -= lsb(pos))
        sum += aib[pos];

    return sum;
}

void update(int pos, int val = 1) {
    for (; pos <= n; pos += lsb(pos))
        aib[pos] += val;
}

int query(int st, int dr) {
    return query(dr) - query(st - 1);
}

int v[NMAX];

int main()
{
    ifstream cin("aib.in");
    ofstream cout("aib.out");

    int q = 0;
    cin >> n >> q;

    for (int i = 1; i <= n; ++ i) {
        cin >> v[i];
        update(i, v[i]);
    }

    int type, pos, v, a, b;
    while (q --) {
        cin >> type;

        if (type == 0) {
            cin >> pos >> v;
            update(pos, +v);
        }
        else if (type == 1) {
            cin >> a >> b;
            cout << query(a, b) << '\n';
        }
        else {
            cin >> v;

            int st = 1;
            int dr = n;
            int mijl;
            int ans = n + 1;

            while (st <= dr) {
                mijl = (st + dr) / 2;
                if (query(mijl) < v)
                    st = mijl + 1;
                else {
                    ans = mijl;
                    dr = mijl - 1;
                }
            }

            cout << ans << '\n';
        }
    }

    //cin.close();
    cout.close();
    return 0;
}