BFS做法: #include<iostream> #include<cstring> #include<queue> using namespace std; typedef pair<int, int> PII; const int N = 505; char map[N][N]; bool st[N][N]; int n, m, flag = 0; int sx, sy, ex, ey; void bfs(int x, int y) { queue<PII>q; q.push({ x, y }); me...