迷宫的最短路径 （BFS）

题意：

给定一个N * M的迷宫，‘#’为墙壁，'.'为通道，‘S'为起点，’G'为终点，求从起点到终点所需的最小步数。

示例输入：

10 10
#S######.#
......#..#
.#.##.##.#
.#........
##.##.####
....#....#
.#######.#
....#.....
.####.###.
....#...G#

示例输出：

22

#include <cstdio>
#include <queue>
using namespace std;

const int INF = 100000000;

typedef pair<int, int> P;

char maze[100][100];
int d[100][100];
int n, m;
int sx, sy;
int gx, gy;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int res;

int bfs()
{
    queue<P> que;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            d[i][j] = INF;
        }
    }
    que.push(P(sx, sy));
    d[sx][sy] = 0;
    while (que.size()){
        P p = que.front();
        que.pop();
        if (p.first == gx && p.second == gy)
            break;
        for (int i = 0; i < 4; i++){
            int nx = p.first + dx[i], ny = p.second + dy[i];
            if (nx >= 0 && nx < n && ny >= 0 && ny < m && maze[nx][ny] != '#' && d[nx][ny] == INF){
                que.push(P(nx, ny));
                d[nx][ny] = d[p.first][p.second] + 1;
            }
        }
    }
    return d[gx][gy];
}

int main()
{
    res = 0;
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++){
        scanf("%s", maze[i]);
    }
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            if (maze[i][j] == 'S'){
                sx = i, sy = j;
            }
            if (maze[i][j] == 'G'){
                gx = i, gy = j;
            }
        }
    }
    res = bfs();
    printf("%d\n", res);
    return 0;
}