2505.cpp

这是哈尔滨工业大学acmOJ的源代码

/* This Code is Submitted by wywcgs for Problem 2505 on 2007-06-05 at 10:15:07 */
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 128;

int main()
{
	int n, e[N], x[N] = { 0 };
	while(scanf("%d", &n) != EOF && n != 0) {
		for(int i = 0; i < n; i++) scanf("%d", &e[i]);
		bool hide[N] = { false };
		for(int i = 1; i < n; i++) {
			x[i] = -1<<20;
			for(int j = 0; j < i; j++)
				if(e[i] >= e[j]) x[i] >?= x[j]+3*e[j]-e[i];
				else x[i] >?= x[j]+e[j]+e[i];
		}
		bool cov[N*32] = { false }, used[N] = { false };
		for(int i = 0; i < n; i++) {
			int m = -1, mi = 0;
			for(int j = 0; j < n; j++)
				if(!used[j] && m < e[j]) { m = e[j]; mi = j; }
			hide[mi] = used[mi] = true;
			for(int j = 0; j < 2*e[mi]; j++) {
				if(!cov[j+x[mi]]) hide[mi] = false;
				cov[j+x[mi]] = true;
			}
		}
		int prt = 0;
		for(int i = 0; i < n; i++)
			if(!hide[i]) printf("%s%d", prt++ ? " " : "", i+1);
		printf("\n");
	}
	return 0;
}