Pagini recente » Cod sursa (job #2784885) | Cod sursa (job #2307482) | Cod sursa (job #1468145) | Cod sursa (job #1758056) | Cod sursa (job #1258369)
#include<stdio.h>
int a[120001],aint[120001],poz[120001];
int query(int nod,int st,int dr,int i)
{
--aint[nod];
if (st==dr)
return st;
int med=(st+dr)/2;
if (i<=aint[2*nod])
return query(2*nod,st,(st+dr)/2,i);
else
return query(2*nod+1,med+1,dr,i-aint[2*nod]);
}
int main()
{
int n,i,x=2;
freopen("schi.in","r",stdin);
freopen("schi.out","w",stdout);
scanf("%d",&n);
do
{
x=x*2;
}while(x<n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=x;i<x+n;i++)
aint[i]=1;
for(i=x-1;i;i--)
aint[i]=aint[2*i]+aint[2*i+1];
for(i=n;i>0;i--)
poz[query(1,1,x,a[i])]=i;
for(i=1;i<=n;i++)
printf("%d\n",poz[i]);
return 0;
}