Cod sursa(job #3187507)

Utilizator robert_dumitruDumitru Robert Ionut robert_dumitru Data 29 decembrie 2023 11:58:59
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.27 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 x, int p)
{
    while (p <= n)
    {
        aib[p] += x;
        p += (p & (-p));
    }
}
int Query(int p)
{
    int suma = 0;
    while (p >= 1)
    {
        suma += aib[p];
        p -= (p & (-p));
    }
    return suma;
}
int CautBin(int val)
{
    int st, dr, mij, p, s;
    st = 1; dr = n; p = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        s = Query(mij);
        if (s == val)
        {
            p = mij;
            dr = mij - 1;
        }
        else if (s > val)
            dr = mij - 1;
        else 
            st = mij + 1;
    }
    return p;
}

int main()
{   
    int T, a, b;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> a;
        Update(a, i);
    }
    while (m--)
    {
        fin >> T;
        if (T == 0)
        {
            fin >> a >> b;
            Update(b, a);
        }
        else if (T == 1)
        {
            fin >> a >> b;
            fout << Query(b) - Query(a - 1) << "\n";
        }
        else 
        {
            fin >> a;
            fout << CautBin(a) << "\n";
        }
    }
}