uva10720(Graph Construction)贪心＋havel定理

思路：这题主要就是运用havel定理进行贪心，判断一个序列是否可图化。

// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
bool cmp(int a,int b)
{
	return a>b?1:0;
}
int deg[10010];
int n;
void solve()
{
	int i,flag,tmp;
	flag=1;
	int m=n;
	while(m--)
	{
		sort(deg,deg+n,greater<int>());
		tmp=deg[0];
		if (tmp<=0) break;
		if (tmp>=n){//tmp<n <-> tmp<=n-1;
			flag=0;
			break;
		}
		for (int i=1;i<=tmp;i++)
		{
			deg[i]--;
			if (deg[i]<0)
			{
				flag=0;
				break;
			}
		}
		deg[0]=0;
		if (!flag) break;
	}
	if (flag)puts("Possible");
	else puts("Not possible");
}
int main()
{	
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	while(scanf("%d",&n)&&n){
		for (int i=0;i<n;++i)
			scanf("%d",°[i]);
		solve();
	}
	return 0;
}