Cod sursa(job #2774272)

Utilizator raulandreipopRaul-Andrei Pop raulandreipop Data 10 septembrie 2021 19:51:01
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.4 kb
#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

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

int n;
int bit[100010];

void update (int i, int val)
{
    while (i <= n)
    {
        bit[i] += val;
        i += (i & -i);
    }
}
int ps(int i)
{
    int sum = 0;
    while (i > 0)
    {
        sum += bit[i];
        i -= (i & -i);
    }
    return sum;
}
int rangeSum(int i, int j){
    return ps(j) - ps(i - 1);
}

int main ()
{
    int m;
    in >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int x;
        in >> x;
        update (i, x);
       // cout << ps(i - 1);
    }
    for (int i = 1; i <= m; i++)
    {
        int q;
        in >> q;
        if (q == 0)
        {
            int a, b;
            in >> a >> b;
            update (a, b);
        }
        if (q == 1)
        {
            int a, b;
            in >> a >> b;
            out << rangeSum(a, b) << "\n";
        }
        if (q == 2)
        {
            int a;
            in >> a;
            int h = n + 1, l = 1;
            while (l < h)
            {
                int mid = (l + h) / 2;
                if (ps(mid) >= a)
                    h = mid;
                else l = mid + 1;
            }
            if (ps(h) == a)
                out << h << "\n";
            else out << -1 << "\n";
        }
    }
}