HDU 1240（Asteroids!）

广搜题，主要是理解题意：首先输入立方体的层数 N 和 N*N*N 的地图，然后输入起点坐标和终点坐标。查找从起点到终点的最小步数。（注意输入中起点和终点的三维坐标是 Z轴、Y轴、X轴的顺序）

#include <iostream>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
const int MAXN = 15;

struct Node //地图中的点
{
    int x, y, z; //三维坐标
    int step; //从起点到该点的最小步数
}now, nex;

char mp[MAXN][MAXN][MAXN]; //地图
int vis[MAXN][MAXN][MAXN]; //访问情况
int fx[6] = { 0,0,1,-1,0,0 }; //X轴方向
int fy[6] = { 1,-1,0,0,0,0 }; //Y轴方向
int fz[6] = { 0,0,0,0,1,-1 }; //Z轴方向
int n; //地图边长
int ex, ey, ez; //终点三维坐标

//广搜，查找从起点到终点的最小步数
void bfs(int x, int y, int z)
{
    memset(vis, 0, sizeof(0));
    vis[x][y][z] = 1;
    now.x = x; now.y = y; now.z = z; now.step = 0;
    queue<Node> q;
    q.push(now);
    while (!q.empty())
    {
        now = q.front();
        q.pop();
        if (now.x == ex && now.y == ey && now.z == ez) //到达终点
        {
            cout << n << " " << now.step << endl;
            return;
        }
        for (int i = 0; i < 6; i++) //依次搜索6个方向
        {
            nex.x = now.x + fx[i];
            nex.y = now.y + fy[i];
            nex.z = now.z + fz[i];
            if (nex.x >= 0 && nex.x < n && nex.y >= 0 && nex.y < n && nex.z >= 0 && nex.z < n
                && vis[nex.x][nex.y][nex.z] == 0 && mp[nex.x][nex.y][nex.z] != 'X')
            {
                nex.step = now.step + 1;
                q.push(nex);
                vis[nex.x][nex.y][nex.z] = 1;
            }
        }
    }
    cout << "NO ROUTE" << endl;
}

int main()
{
    string start; //读入START和END
    while (cin >> start >> n)
    {
        int sx, sy, sz; //起点三维坐标
        for (int i = 0; i < n; i++) //输入地图
        {
            for (int j = 0; j < n; j++)
                cin >> mp[i][j];
        }
        cin >> sz >> sy >> sx >> ez >> ey >> ex;
        cin >> start;
        bfs(sx, sy, sz);
    }
    return 0;
}

继续加油。