Cod sursa(job #3256419)

Utilizator GILIEDAVIDGilie David Florin GILIEDAVID Data 14 noiembrie 2024 16:08:32
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int n,m,i,x,c,a,b,aib[100005];
void adun(int x,int val)
{
    for(int i=x;i<=n;i+=i&(-i))
        aib[i]+=val;
}
int suma(int x)
{
    int s=0;
    for(int i=x;i>=1;i-=i&(-i))
        s+=aib[i];
    return s;
}
int caut(int n,int a)
{
    int p=1,u=n;
    while(p<=u)
    {
        int mij=(p+u)/2;
        if(suma(mij)<a) p=mij+1;
        else if(suma(mij)>a) u=mij-1;
        else
            return mij;
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>x;
        adun(i,x);
    }
    for(i=1;i<=m;i++)
    {
        f>>c;
        if(c==0)
        {
            f>>a>>b;
            adun(a,b);
        }
        else
            if(c==1)
        {
            f>>a>>b;
            g<<suma(b)-suma(a-1)<<'\n';
        }
        else
        {
            f>>a;
            g<<caut(n,a)<<'\n';
        }
    }
    return 0;
}