Cod sursa(job #3256420)

Utilizator Cezar1432Dogaru Cezar Cezar1432 Data 14 noiembrie 2024 16:09:35
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int aib[160001],n,m,a,b;

void adun(int a, int b){
    for(int i=a;i<=n;i+=i&(-i))
        aib[i]+=b;
}
int suma(int x){
    int s=0;
    for(int i=x;i>=1;i-=i&(-i))
        s+=aib[i];
    return s;

}
int caut(int s){

    int dr=n;
    int st=1;
    int m;
    while(st<=dr){
            m=(st+dr)/2;
        if(suma(m)-suma(0)>a)
            dr=m;
        else if(suma(m)-suma(0)<a){
                st=m+1;
        }
    else if(suma(m)-suma(0)==a)
        return m;

        }
    }

int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        int x;
        f>>x;
        adun(i,x);
    }
    for(int i=1;i<=m;i++)
    {
        int op;
        f>>op;
        if(op==0)
        {
            f>>a>>b;
            adun(a,b);

        }
        else if(op==1)
        {
            f>>a>>b;
            g<<suma(b)-suma(a-1)<<'\n';
        }
        else{
            f>>a;
            g<<caut(a)<<'\n';
        }
    }
    return 0;
}