UVA 193 - Graph Coloring
2014-08-15 00:14
288 查看
题目大意:给你 N 个点, K条边,相邻的两个点不能同时为黑色,求最多可以有几个黑色的点,并输出这些点的编号
解题思路:用二维数组记录下每个点的周围的点,用于判断周围是否有黑色,然后用 DFS 寻找所有的上色方案,并记录下黑色点最多的那个方案
解题思路:用二维数组记录下每个点的周围的点,用于判断周围是否有黑色,然后用 DFS 寻找所有的上色方案,并记录下黑色点最多的那个方案
#include <cstdio> #include <cstring> int edge[110][110], color[110] = {0}, ans[110], max, n; bool check(int move) { //判断是否可以上色 for (int j = 1; j <=n; j++) if (edge[move][j] == 1 && color[j] == 1) return false; return true; } void dfs(int move, int sum) { if (move == n + 1) { if (sum > max) { max = sum; //记录最大值 for (int i = 1, r = 0; i <= n; i++) //记录上色的点 if (color[i]) ans[r++] = i; } return ; } if (check(move)) { color[move] = 1; //上色 dfs(move + 1, sum + 1); color[move] = 0; } dfs(move + 1, sum); //不上色 } int main () { int m, k; scanf("%d", &m); while (m--) { scanf("%d%d", &n, &k); memset(edge,0,sizeof(edge)); int x, y; while (k--) { scanf("%d%d", &x, &y); edge[x][y] = edge[y][x] = 1; //初始化各个点间的关系 } max = 0; dfs(1, 0); printf("%d\n", max); for (int i = 0; i < max; i++) printf(i == max - 1 ? "%d\n" : "%d ", ans[i]); } return 0; }
相关文章推荐
- UVA 193 Graph Coloring
- uva 193 Graph Coloring( 图染色 ) DFS+回溯
- UVa 193 - Graph Coloring(graph theory, brute force, backtracking, NP-complete, maximum independent set.)
- UVa 193 - Graph Coloring
- poj 1419 Graph Coloring uva 193 - Graph Coloring (图着色问题,dfs)
- Uva 193 - Graph Coloring
- UVa 193 - Graph Coloring
- uva193 - Graph Coloring
- UVA 193 Graph Coloring
- uva 193 Graph Coloring
- UVA 193 Graph Coloring 图染色 DFS 数据
- [回溯]Graph Coloring UVA193
- uva 193 Graph Coloring(图染色 dfs回溯)
- uva 193 Graph Coloring
- UVA 193 Graph Coloring 图染色 DFS 数据
- UVA 193 Graph Coloring
- UVa 193 - Graph Coloring
- UVa 193 - Graph Coloring
- uva - 193 Graph Coloring(回溯)
- UVa 193 & POJ 1419 - Graph Coloring