Pagini recente » Cod sursa (job #296287) | Cod sursa (job #298953) | Cod sursa (job #297901) | Cod sursa (job #1561426) | Cod sursa (job #1566416)
#include <fstream>
using namespace std;
ifstream cin("schi.in");
ofstream cout("schi.out");
const int MAX = 30001;
int v[MAX], bit[MAX], n, sol[MAX];
void update(int pos){
while(pos<=n){
bit[pos]--;
pos = pos + (pos & -pos);
}
}
int getpos(int val){
int pos = 1, ans = 0;
while(pos<n) pos <<= 1;
while(pos>0){
if(ans+pos<=n){
if(bit[ans+pos]<val){
val -= bit[ans+pos];
ans += pos;
}
}
pos >>= 1;
}
return ans+1;
}
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
for(int i=1; i<=n; i++)
bit[i] = i & -i;
for(int i=n; i>=1; i--){
int loc = getpos(v[i]);
sol[loc] = i;
update(loc);
}
for(int i=1; i<=n; i++)
cout<<sol[i]<<'\n';
return 0;
}