Pagini recente » Cod sursa (job #903745) | Cod sursa (job #244075) | Cod sursa (job #1367736) | Cod sursa (job #389846) | Cod sursa (job #1142232)
#include <cstdio>
#define bit(x) (x&(-x))
#define inf (1<<20)
using namespace std;
int i,n,aib[30001],sol[30001],x,a[30001];
void update(int poz)
{
int i;
for(i=poz; i<=n; i+=bit(i))
aib[i]--;
}
int query(int poz)
{
int i,s=0;
for(i=poz; i>=1; i-=bit(i))
s+=aib[i];
return s;
}
int bs(int x)
{
int st,dr,m,s,Min=inf;
st=1; dr=n;
while(st<=dr)
{
m=(st+dr)/2;
s=query(m);
if(s==x && m<Min) Min=m;
else if(s==x) dr=m-1;
else if(s>x) dr=m-1;
else st=m+1;
}
return Min;
}
int main()
{
freopen("schi.in","r",stdin);
freopen("schi.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
aib[i]=bit(i);
}
for(i=n;i>=1;i--)
{
x=bs(a[i]);
sol[x]=i;
update(x);
}
for(i=1;i<=n;i++)
{
printf("%d\n",sol[i]);
}
return 0;
}