uva 10720 Graph Construction
2015-02-15 20:01
239 查看
用了下面这个定理
Havel-Hakimi定理
Havel-Hakimi定理
#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> #include<iostream> using namespace std; int a[10004],n; bool cmp(int a,int b) { return a>b; } bool fun() { int i,j; for(i=0;i<n-1;i++) { sort(a+i,a+n,cmp); if(i+a[i]>=n) return 0; for(j=i+1;j<=i+a[i];j++) { a[j]--; if(a[j]<0) return 0; } } if(a[n-1]!=0) return 0; return 1; } int main() { int i; while(~scanf("%d",&n)&&n) { for(i=0;i<n;i++) scanf("%d",&a[i]); if(fun()) printf("Possible\n"); else printf("Not possible\n"); } return 0; }
相关文章推荐
- UVA 10720 Graph Construction
- UVA 10720 Graph Construction
- uva 10720 Graph Construction
- UVA 10720 Graph Construction
- uva 10720
- uva10720 - Graph Construction(图重建)
- UVa 10720 - Graph Construction(Havel-Hakimi定理)
- UVA10720- Graph Construction
- UVa:10720 Graph Construction
- Havel-Hakimi定理(判断一个序列是否可图) UVA 10720
- uva10720(Graph Construction)贪心+havel定理
- UVa 10720 - Graph Construction
- UVA 10720
- uva 10720(贪心)
- UVA 10720 Graph Construction 贪心+优先队列
- UVA 10720 Graph Construction(贪心 + Havel-Hakimi定理)
- UVa 10720 - Graph Construction
- uva 10720 Graph Construction
- uva10720 Graph Construction
- uva 10720 Graph Construction