Pagini recente » Cod sursa (job #2837210) | Cod sursa (job #1135741) | Cod sursa (job #124396) | Cod sursa (job #692328) | Cod sursa (job #2067189)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int arb[4*30001],a[30001],v[30001],n;
void build(int nod,int poz,int val,int st,int dr)
{
int mij=(st+dr)/2;
if(st==dr)
{
arb[nod]=1;
v[poz]=val;
return;
}
if(poz+arb[nod*2]<=mij)
build(nod*2,poz,val,st,mij);
else
build(nod*2+1,poz+arb[nod*2],val,mij+1,dr);
arb[nod]=arb[nod*2]+arb[nod*2+1];
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
for(int i=n;i>=1;i--)
{
build(1,a[i],i,1,n);
}
for(int i=1;i<=n;i++)
fout<<v[i]<<'\n';
return 0;
}