Cod sursa(job #2339178)

Utilizator mjmilan11Mujdar Milan mjmilan11 Data 8 februarie 2019 15:37:47
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <iostream>
#include <fstream>

#define p2(x) (x & -x)

using namespace std;

ifstream fin("schi.in");
ofstream fout("schi.out");

const int NMAX = 30005;
int v[NMAX],rasp[NMAX];
int init[NMAX];
int n;

void Update(int poz,int x)
{
    for(int i=poz;i<=n;i+=p2(i)) v[i]+=x;
}

int Suma(int poz)
{
    int sum=0;
    for(int i=poz;i>=1;i-=p2(i)) sum+=v[i];
    return sum;
}

int main()
{
    fin >> n;
    for(int i=1;i<=n;i++)
    {
        fin >> init[i];
        Update(i,1);
    }
    int maxim=p2(n)*2;
    for(int i=n;i>=1;i--)
    {
        int aux=maxim;
        int k=0;
        while(aux!=0)
        {
            if(k+aux<=n)
            {
                if(Suma(k+aux)<init[i]) k+=aux; /// Cautare() ;
            }
            aux/=2;
        }
        k++;
        rasp[k]=i;
        Update(k,-1);
    }
    for(int i=1;i<=n;i++) fout << rasp[i] << '\n';
    return 0;
}