Pagini recente » Cod sursa (job #2624843) | Cod sursa (job #1287924) | Cod sursa (job #15614) | Cod sursa (job #244545) | Cod sursa (job #2074344)
#include <bits/stdc++.h>
#define L 2 * pos
#define R 2 * pos + 1
using namespace std;
ifstream in("schi.in");
ofstream out("schi.out");
int n, a[30100], h[120100], sol[30100], x, p;
void build(int st, int dr, int pos){
if(st == dr){
h[pos] = 1;
return;
}
int mid = (st + dr) >> 1;
build(st, mid, L);
build(mid + 1, dr, R);
h[pos] = h[L] + h[L];
}
void update(int st, int dr, int pos, int nr, int cur){
if(st == dr){
h[pos] = 0;
sol[st] = p;
return;
}
int mid = (st + dr) >> 1;
if(cur + h[L] >= nr)
update(st, mid, L, nr, cur);
else
update(mid + 1, dr, R, nr, cur + h[L]);
h[pos] = h[L] + h[R];
}
int main(){
in >> n;
for(int i = 1; i <= n; i++)
in >> a[i];
build(1, n, 1);
for(int i = n; i >= 1; i--){
p = i;
update(1, n, 1, a[i], 0);
}
for(int i = 1; i <= n; i++)
out << sol[i] << '\n';
return 0;
}