Pagini recente » Cod sursa (job #2357375) | Cod sursa (job #2616898) | Cod sursa (job #3041589) | Cod sursa (job #1828545) | Cod sursa (job #1140876)
#include <cstdio>
#define ub(x) (x&(-x))
# define INF (1<<20)
using namespace std;
int a[30010],i,j,sol[30010],n,aib[30010],x;
int s(int x)
{
int rez=0;
for (int i=x; i>0; i-=ub(i)) rez+=aib[i];
return rez;
}
int cb(int x)
{
int st=1,dr=n; int mi=INF;
while (st<=dr)
{
int mij=(st+dr)/2; int su=s(mij);
if (su==x && mij<mi) mi=mij;
else if (su==x) dr=mij-1;
else if (su>x) dr=mij-1;
else st=mij+1;
}
return mi;
}
void update(int x)
{
for (int i=x; i<=n; i+=ub(i)) aib[i]--;
}
int main()
{
freopen("schi.in","r",stdin);
freopen("schi.out","w",stdout);
scanf("%d", &n);
for (i=1; i<=n; ++i) aib[i]=ub(i);
for (i=1; i<=n; ++i) scanf("%d", &a[i]);
for (i=n; i>=1; --i)
{
x=a[i];
int pp=cb(x);
sol[pp]=i;
update(pp);
}
for (i=1; i<=n; ++i) printf("%d\n", sol[i]);
return 0;
}