POJ 2251 Dungeon Master

解题思路：三维数组，简单宽搜，注意细节。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 35;
int dir[6][3] = {0, 0, 1, 0, 0, -1, 0, 1, 0, 0, -1, 0,
                1, 0, 0, -1, 0, 0}; //上、下
int L, R, C, sz, sx, sy;
char mapp[maxn][maxn][maxn];

struct node{
    int z, x, y, cnt;
}p, n;

queue<node> q;

int BFS(int a, int b, int c)
{
    while(!q.empty()) q.pop(); //清空队列
    mapp[a][b][c] = '#'; //把起始点标记为#
    p.z = a, p.x = b, p.y = c, p.cnt = 0;
    q.push(p);

    while(!q.empty())
    {
        p = q.front();
        q.pop();

        for(int i = 0; i < 6; i++)
        {
            int zz = p.z + dir[i][0];
            int xx = p.x + dir[i][1];
            int yy = p.y + dir[i][2];

            if(mapp[zz][xx][yy] == '#') continue; //走过的或不能走的路就进行下一次循环
            if(mapp[zz][xx][yy] == 'E') return p.cnt + 1; //碰到‘E’就返回，记住加1
            mapp[zz][xx][yy] = '#'; 
            n.z = zz, n.x = xx, n.y = yy, n.cnt = p.cnt + 1;
            q.push(n);
        }
    }
    return -1;
}

int main()
{
    char str[maxn];
    while(~scanf("%d %d %d", &L, &R, &C) && (L || R || C))
    {
        memset(mapp, '#', sizeof(mapp));
        for(int i = 1; i <= L; i++)
        {
            for(int j = 1; j <= R; j++)
            {
                scanf("%s", str+1); //这里记住要加1，scanf不吃回车键。
                for(int k = 1; k <= C; k++)
                {
                    mapp[i][j][k] = str[k];
                    if(mapp[i][j][k] == 'S') sz = i, sx = j, sy = k;
                }
            }
        }

        int ans = BFS(sz, sx, sy);

        if(ans == -1) printf("Trapped!\n"); //说明没有找到出口
        else printf("Escaped in %d minute(s).\n", ans);
    }
    return 0;
}