Pagini recente » Cod sursa (job #1981037) | Cod sursa (job #1708795) | Cod sursa (job #1217330) | Cod sursa (job #40741) | Cod sursa (job #1140799)
# include <cstdio>
# define zero(x) (x&(-x))
# define INF (1<<20)
# define N 30010
using namespace std;
int a[N],n,i,x;
int aib[N],sol[N];
void update(int poz)
{
int i;
for(i=poz; i<=n; i+=zero(i))
aib[i]--;
}
int query(int poz)
{
int i,s=0;
for(i=poz; i>=1; i-=zero(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", &n);
for(i=1; i<=n; ++i)
{
scanf("%d\n", &a[i]);
aib[i]=zero(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]);
}