Cod sursa(job #1640487)

Utilizator leopop29Pop Leonard leopop29 Data 8 martie 2016 17:56:43
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.33 kb
//#include <iostream>
#include <fstream>
#include <vector>
#define a first
#define b second
#define NM 100005

using namespace std;

int n, m, aib[NM];

int lsb(int x)
{
    return ((x&(x-1))^x);
}

void update(int p, int x)
{
    for(int i = p; i <= n; i += lsb(i))
    {
        aib[i] += x;
    }
}

int query(int p)
{
    int sm = 0;
    for(int i = p; i > 0; i -= lsb(i))
        sm += aib[i];
    return sm;
}

int sum(int l, int r)
{
    return query(r)-query(l-1);
}

int sr(int s)
{
    int st = 1;
    for(; st < n; st <<= 1);

    for(int i = 0; st; st >>= 1)
        if(i+st <= n && s >= aib[i+st])
        {
            i += st;
            s -= aib[i];
            if(!s)
                return i;
        }
    return -1;
}

int main()
{
    ifstream f("aib.in");
    ofstream cout("aib.out");
    int x;
    f >> n >> m;

    for(int i = 1; i <= n; ++i)
        f >> x, update(i, x);

    int y, z;
    for(int i = 1; i <= m; ++i)
    {
        f >> x;
        if(!x)
        {
            f >> y >> z;
            update(y, z);
        }
        else if(x&1)
        {
            f >> y >> z;
            cout << sum(y, z) << '\n';
        }
        else
        {
            f >> y;
            cout << sr(y) << '\n';
        }
    }

    return 0;
}