解析:不解释,直接起手就是一个dfs #include <iostream> #include <algorithm> #include <cstring> #include <cstdio> using namespace std; const int maxn = 105; int dx[] = {0,1,-1,0,-1,1,-1,1}; int dy[] = {1,0,0,-1,-1,1,1,-1}; char mapple[maxn][maxn]; int vis[max...