Cod sursa(job #1506954)

Utilizator dorin31Geman Dorin Andrei dorin31 Data 21 octombrie 2015 09:23:53
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.14 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int n,m,aib[100001];

inline int zeros(int x)
{
    return (-x)&x;
}

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

int sum(int poz)
{
    long long s=0;
    for (; poz; poz-=zeros(poz))
        s+=aib[poz];
    return s;
}

int pozK(int a)
{
    for (int i=1; i<=n; i+=zeros(i))
        if (sum(i)==a) return i;
    return -1;
}

int main()
{
    fin>>n>>m; int x;
    for (int i=1; i<=n; ++i)
    {
        fin>>x;
        update(i,x);
    }
    for (int i=1; i<=m; ++i)
    {
        int caz; fin>>caz;
        int a,b;
        switch(caz)
        {
            case 0:
                    fin>>a>>b;
                    update(a,b);
                    break;
            case 1:
                    fin>>a>>b;
                    fout<<sum(b)-sum(a-1)<<'\n';
                    break;
            case 2:
                    fin>>a;
                    fout<<pozK(a)<<'\n';
                    break;
        }
    }
    return 0;
}