Cod sursa(job #2752311)

Utilizator Moise_AndreiMoise Andrei Moise_Andrei Data 17 mai 2021 17:52:10
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.22 kb
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream in("aib.in");
ofstream out("aib.out");
int v[100005];
int n, m;
void update(int a, int b)
{
    while(a <= n)
    {
        v[a] += b;
        a += (a & (-a));
    }
}
int query(int a)
{
    int s = 0;
    while(a > 0)
    {
        s += v[a];
        a -= (a & (-a));
    }
    return s;
}
int f2(int a, int b)
{
    int st = 1, dr = b;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        int s = query(mij);
        if(s == a)
            return mij;
        if(s < a)
            st = mij + 1;
        else
            dr = mij - 1;
    }
}
int32_t main()
{
    in >> n >> m;
    for(int i = 1; i <= n; i ++)
    {
        int a;
        in >> a;
        update(i, a);
    }
    for(int i = 1; i <= m; i ++)
    {
        int t, a;
        in >> t >> a;
        if(t == 2)
        {
            out << f2(a, n) << '\n';
        }
        else
        {
            int b;
            in >> b;
            if(t == 1)
            {
                out << query(b) - query(a - 1) << '\n';
            }
            else
                update(a, b);
        }
    }
    return 0;
}