Pagini recente » Cod sursa (job #1781137) | Cod sursa (job #118053) | Cod sursa (job #3269844) | Cod sursa (job #913432) | Cod sursa (job #1429622)
#include <fstream>
#include <string.h>
#include <algorithm>
#define dim 30001
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int poz,pozst,i,pozdr,INF,n,arb[3*dim],val,sol[dim];
short int v[dim];
void build(int nod, int st, int dr)
{
if(st==dr)
{
arb[nod]=1;
return;
}
int mijl=(st+dr)/2;
build(2*nod,st,mijl);
build(2*nod+1,mijl+1,dr);
arb[nod]=arb[nod*2]+arb[nod*2+1];
}
void upDate(int nod, int st, int dr)
{
if(st==dr)
{
arb[nod]=0;
poz=st;
return;
}
int mijl=(st+dr)/2;
if(arb[2*nod]>=val)
upDate(2*nod,st,mijl);
else
{
val-=arb[2*nod];
upDate(2*nod+1,mijl+1,dr);
}
arb[nod]=arb[2*nod]+arb[2*nod+1];
}
int main()
{
fin>>n;
build(1,1,n);
for(i=1;i<=n;i++)
fin>>v[i];
for(i=n;i>=1;i--)
{
val=v[i];
upDate(1,1,n);
sol[poz]=i;
}
for(i=1;i<=n;i++)
fout<<sol[i]<<'\n';
return 0;
}