答案:<pre class="brush:cpp;toolbar:false">#include <bits/stdc++.h>
using namespace std;
int n, m, p[10008], q[10008], ans[108][108], qx, qy, zx, zy;
char a[108][108];
int xx[5] = {0, 1, -1, 0, 0};
int yy[5] = {0, 0, 0, 1, -1};
void bfs() {
a[qx][qy] = '#';
ans[qx][qy] = 0;
int head = 1;
int tail = 1;
p[1] = qx;
q[1] = qy;
while (head <= tail) {
for (int i = 1; i <= 4; i++) {
int h = p[head] + xx[i];
int l = q[head] + yy[i];
if (a[h][l] != '#' && h >= 1 && l >= 1 && h <= n && l <= m) {
a[h][l] = '#';
tail++;
p[tail] = h;
q[tail] = l;
ans[h][l] = ans[p[head]][q[head]] + 1;
if (h == zx && l == zy) {
cout << ans[h][l] << endl;
return;
}
}
}
head++;
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] == 'S') {
qx = i;
qy = j;
}
if (a[i][j] == 'T') {
zx = i;
zy = j;
}
}
}
bfs();
return 0;
}</pre>
这道题暂未补解析。