Pagini recente » Cod sursa (job #1766689) | Cod sursa (job #2928173) | Cod sursa (job #747611) | Cod sursa (job #626255) | Cod sursa (job #1425656)
#include <cstdio>
#include <climits>
#define ub(x) (x&(-x))
using namespace std;
int n,i,poz,b[30005],a[30005],A[30001];
void undo(int poz)
{
int i;
for (i=poz; i<=n; i+=ub(i))A[i]--;
}
int sum(int poz)
{
int i,s=0;
for (i=poz; i>0; i-=ub(i))
s+=A[i];
return s;
}
int caut(int x)
{
int st,dr,mij,miny=INT_MAX,X;
st=1;
dr=n;
while (st<=dr)
{
mij=(st+dr)/2;
X=sum(mij);
if (X==x&&mij<miny)
{
miny=mij;
}
else if (X>=x)dr=mij-1;
else st=mij+1;
}
return miny;
}
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]);
}
for (i=1; i<=n; i++)A[i]=ub(i);
for (i=n; i>=1; i--)
{
poz=caut(a[i]);
b[poz]=i;
undo(poz);
}
for (i=1; i<=n; i++)
printf("%d\n",b[i]);
return 0;
}