Pagini recente » Cod sursa (job #849132) | Cod sursa (job #2877923) | Cod sursa (job #3351681) | Cod sursa (job #500135) | Cod sursa (job #1364826)
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 30000;
int v[MAXN+1], N;
void insereaza(int poz, int x, int n)
{
for(int i = n + 1; i > poz; i--)
v[ i ] = v[ i - 1 ];
v[ poz ] = x;
}
int main()
{
freopen("schi.in","r",stdin);
freopen("schi.out","w",stdout);
scanf("%d",&N);
for(int i = 1; i <= N; i++)
{
int p; scanf("%d",&p);
insereaza( i + 2 - p, i, i );
}
for(int i = N + 1; i >= 2; i--)
printf("%d\n",v[ i ]);
return 0;
}