2182.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

#include <stdio.h>
#include <memory.h>

bool sign[8000];
int a[8000];

int main()
{
	int i, j, n, k;
	
	scanf( "%d", &n );
	
	a[0] = 0;
	for( i=1; i<n; i++ )
		scanf( "%d", &a[i] );

	memset( sign, 0, n*sizeof(bool) );

	for( i=n-1; i>=0; i-- )
	{
		k = a[i];
		for( j=0; k || sign[j]; j++ )
		k -= (int)( !sign[j] );

		sign[j] = true;
		a[i] = j + 1;
	}

	for( i=0; i<n; i++ )
	printf( "%d\n", a[i] );

	return 0;
}