Cod sursa(job #1979280)

Utilizator NineshadowCarapcea Antonio Nineshadow Data 10 mai 2017 09:45:04
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <bits/stdc++.h>
#define MAXN 100005
using namespace std;
ifstream in("aib.in");
ofstream out("aib.out");
int n,m,AIB[MAXN],a,b,p;
void update(int i, int s)
{
    int t=0;
    while(i<=n)
    {
        AIB[i]+=s;
        i=i+(i&(-i));
    }
}
int query(int i)
{
    int t=0;
    while(i>0)
    {
        t+=AIB[i];
        i=i-(i&(-i));
    }
    return t;
}
int main()
{
    in>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        in>>p;
        update(i,p);
    }
    while(m--)
    {
        in>>p>>a;
        if(p==0)
        {
            in>>b;
            update(a,b);
        }
        else if(p==1)
        {
            in>>b;
            out<<query(b)-query(a-1)<<'\n';
        }
        else
        {
            for(int i=1; i<=n; ++i)
                if(query(i)==a)
                {
                    out<<i<<'\n';
                    break;
                }
        }
    }

    return 0;
}