Pagini recente » Cod sursa (job #1337484) | Cod sursa (job #1948331) | Cod sursa (job #695853) | Cod sursa (job #2193159) | Cod sursa (job #381144)
Cod sursa(job #381144)
#include <stdio.h>
int v[65001],a[65001],b[65001];
int place(int l,int r,int nod,int i)
{
--a[nod];
if (l==r) return l;
if (i<=a[2*nod]) return place(l,(l+r)/2,2*nod,i);
else return place((l+r)/2+1,r,2*nod+1,i-a[2*nod]);
}
int main()
{
int n,i,x=2;
freopen("schi.in","r",stdin);
freopen("schi.out","w",stdout);
scanf("%d",&n);
do
{
x*=2;
}
while (x<n);
for (i=1;i<n+1;i++) scanf("%d",&v[i]);
for (i=x;i<x+n;i++) a[i]=1;
for (i=x-1;i>0;i--) a[i]=a[2*i]+a[2*i+1];
for (i=n;i>0;i--)
b[place(1,x,1,v[i])]=i;
for (i=1;i<n+1;i++) printf("%d\n",b[i]);
return 0;
}