Pagini recente » Cod sursa (job #689702) | Cod sursa (job #3183365) | Cod sursa (job #2540663) | Cod sursa (job #101323) | Cod sursa (job #2908709)
#include<fstream>
using namespace std;
ifstream cin("schi.in");
ofstream cout("schi.out");
int a[120001],v[30001],rez[30001];
void construire(int nod,int st,int dr)
{
if(st==dr)
{
a[nod]=1;
}
else
{
construire(nod*2,st,(st+dr)/2);
construire(nod*2+1,(st+dr)/2+1,dr);
a[nod]=a[2*nod]+a[2*nod+1];
}
}
int query(int nod,int st,int dr,int val)
{
a[nod]--;
if(st==dr)
{
return st;
}
int m=(st+dr)/2;
if(a[2*nod]<val)
{
return query(2*nod+1,m+1,dr,val-a[2*nod]);
}
return query(2*nod,st,m,val);
}
main()
{
int n;
cin>>n;
construire(1,1,n);
for(int i=1;i<=n;i++)
cin>>v[i];
for(int i=n;i;i--)
{
rez[query(1,1,n,v[i])]=i;
}
for(int i=1;i<=n;i++)
{
cout<<rez[i]<<'\n';
}
}