摘要： #include #include #include #include using namespace std;const int MAXN=30;int vis[MAXN][MAXN];char maze[MAXN][MAXN];int sx,sy;int counter;void DFS(int x,int y){ if(vis[x][y] || maze[x][y]=='#')return; vis[x][y]=1; counter++; DFS(x-1,y); DFS(x,y-1); DFS(x+1,y); DFS(x,y+1);}int ma... 阅读全文