UVa572 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=513 也就是求联通块个数 运用dfs #include <cstdio>#include <cstring>#define maxn 105char map[maxn][m