Pagini recente » Rating David Filestra (Filestraffff) | Cod sursa (job #907668) | Cod sursa (job #442761) | Cod sursa (job #1546951) | Cod sursa (job #809970)
Cod sursa(job #809970)
#include<stdio.h>
#define size 128
#define maxn 30001
int nr[maxn], cate[maxn], poz[maxn], N, V[maxn];
int bucket_nr;
int afla(int x) {
int i = 0;
while( cate[i] < x)
x-= cate[i++];
i = (i<<7);
while(x)
if( nr[i++] == 1)
--x;
return i - 1;
}
inline void scoate(int val) {
nr[val] = 0;
cate[val>>7]--;
}
int main() {
freopen("schi.in", "r", stdin);
freopen("schi.out", "w", stdout);
scanf("%d", &N);
bucket_nr = maxn/size + 1;
for( int i = 1; i <= N; ++i){
nr[i] = 1;
scanf("%d", &V[i]);
}
for( int i = 0; i <= bucket_nr; ++i)
cate[i] = size;
for( int i = N; i >= 1; --i) {
int x = afla(V[i]);
poz[x] = i;
scoate(x);
}
for( int i = 1; i <= N; ++i)
printf("%d\n", poz[i]);
return 0;
}