Pagini recente » Cod sursa (job #1576964) | Cod sursa (job #1611486) | Cod sursa (job #2734943) | Cod sursa (job #15524) | Cod sursa (job #2752821)
#include <iostream>
#include <fstream>
#define V 30001
using namespace std;
ifstream in("schi.in");
ofstream out("schi.out");
const int N=1 << 17;
int t[N],q[V],sol[V],n,ord,pos;
void add(int p, int l, int r)
{
t[p]++;
if(l==r)
{
sol[l]=pos;
return;
}
int m=(l+r)/2;
if(ord<=(m-l+1-t[2*p])) add(2*p,l,m);
else
{
ord-=(m-l+1-t[2*p]);
add(2*p+1, m+1,r);
}
}
int main()
{
in >> n;
for(int i=0; i<n; i++)
{
in >> q[i];
}
for(int i=n-1; i>=0; i--)
{
ord=q[i];
pos=i+1;
add(1,1,n);
}
for(int i=1; i<=n; i++)
out << sol[i] << "\n";
return 0;
}