Pagini recente » Cod sursa (job #1069074) | Cod sursa (job #223861) | Cod sursa (job #2774556) | Cod sursa (job #3247396) | Cod sursa (job #1140881)
#include <fstream>
#define ub(x) (x&(-x))
#define NMAX 30001
using namespace std;
int AIB[NMAX],a[NMAX],sol[NMAX],n,i,x;
void add(int poz)
{
int i;
for(i=poz; i<=n; i+=ub(i))
AIB[i]--;
}
int sum(int poz)
{
int i,s=0;
for(i=poz; i>0; i-=ub(i))
s+=AIB[i];
return s;
}
int binary_search(int x)
{
int st,dr,mij,s,mn=999999999;
st=1; dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
s=sum(mij);
if(s==x && mij<mn) mn=mij;
else if(s>=x) dr=mij-1;
else st=mij+1;
}
return mn;
}
int main()
{
ifstream f("schi.in");
ofstream g("schi.out");
f>>n;
for (i=1;i<=n;i++) f>>a[i];
for (i=1;i<=n;i++) AIB[i]=ub(i);
for (i=n;i>=1;i--)
x=binary_search(a[i]),sol[x]=i,add(x);
for (i=1;i<=n;i++) g<<sol[i]<<'\n';
f.close();
g.close();
return 0;
}