Cod sursa(job #1684836)

Utilizator CraiuAndrei Craiu Craiu Data 11 aprilie 2016 12:26:08
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.33 kb
#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int aib[100005];

void Update(int p, int x)
{
    while(p <= n)
    {
        aib[p] += x;
        p = p + (p & (-p));
    }
}

int Suma(int p)
{
    int s = 0;
    while(p > 0)
    {
        s = s + aib[p];
        p = p - (p & (-p));
    }
    return s;
}

int Cautbin(int s)
{
    int st, dr, m, suma, sol;
    st = 1;
    dr = n;
    sol = -1;
    while(st <= dr)
    {
        m = (st + dr) / 2;
        suma = Suma(m);
        if(suma == s)
        {
            sol = m;
            dr = m - 1;
        }
        else if(suma > s) dr = m - 1;
        else st = m + 1;
    }
    return sol;
}

int main()
{
    int i, x, y, tip, s;
    fin >> n >> m;
    for(i = 1; i <= n; i++)
    {
        fin >> x;
        Update(i, x);
    }
    for(i = 1; i <= m; i++)
    {
        fin >> tip;
        if(tip == 0)
        {
            fin >> x >> y;
            Update(x, y);
        }
        else if(tip == 1)
        {
            fin >> x >> y;
            s = Suma(y) - Suma(x - 1);
            fout << s << "\n";
        }
        else
        {
            fin >> s;
            fout << Cautbin(s) << "\n";
        }
    }
    fin.close();fout.close();
    return 0;
}