POJ P2251 Dungeon Master 题解

深搜，只不过是三维的。

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<algorithm>
 using namespace std;
 int l,r,c;
 int sx,sy,sz;
 int ex,ey,ez;
 int ans=;
 char map[][][];
 int book[][][]= {};
 int flag=;
 void dfs(int x,int y,int z,int step) {
     if(x==ex&&y==ey&&z==ez) {
         ans=min(ans,step);
         flag=;
         return;
     }
     if(map[x+][y][z]!='#'&&book[x+][y][z]!=&&x+<=l) {
         book[x+][y][z]=;
         dfs(x+,y,z,step+);
         book[x+][y][z]=;
     }
     if(map[x-][y][z]!='#'&&book[x-][y][z]!=&&x->=) {
         book[x-][y][z]=;
         dfs(x-,y,z,step+);
         book[x-][y][z]=;
     }
     if(map[x][y+][z]!='#'&&book[x][y+][z]!=&&y+<=r) {
         book[x][y+][z]=;
         dfs(x,y+,z,step+);
         book[x][y+][z]=;
     }
     if(map[x][y-][z]!='#'&&book[x][y-][z]!=&&y->=) {
         book[x][y-][z]=;
         dfs(x,y-,z,step+);
         book[x][y-][z]=;
     }
     if(map[x][y][z+]!='#'&&book[x][y][z+]!=&&z+<=c) {
         book[x][y][z+]=;
         dfs(x,y,z+,step+);
         book[x][y][z+]=;
     }
     if(map[x][y][z-]!='#'&&book[x][y][z-]!=&&z->=) {
         book[x][y][z-]=;
         dfs(x,y,z-,step+);
         book[x][y][z-]=;
     }
 }
 int main() {
     while((cin>>l>>r>>c)&&l!=&&r!=&&c!=) {
         for(int i=; i<=l; i++) {
             for(int j=; j<=r; j++) {
                 for(int k=; k<=c; k++) {
                     cin>>map[i][j][k];
                     if(map[i][j][k]=='S') {
                         sx=i;
                         sy=j;
                         sz=k;
                         book[i][j][k]=;
                     }
                     if(map[i][j][k]=='E') {
                         ex=i;
                         ey=j;
                         ez=k;
                     }
                 }
             }
         }
         dfs(sx,sy,sz,);
         if(flag==) {
             cout<<"Trapped!"<<endl;
         }
         else
         {
             cout<<"Escaped in "<<ans<<" minute(s)."<<endl;
         }
         memset(book,,sizeof(book));
         flag=;
         ans=;
     }
 }
请各位大佬斧正（反正我不认识斧正是什么意思）