题目简单的3d广搜,做法类似与 hdu 的 胜利大逃亡#define _CRT_SECURE_NO_WARNINGS#include#include#include#include#includeusing namespace std;#define MAXN 32char map[MAXN][MAXN][MAXN];int a,b,c;bool vis[MAXN][MAXN][MAXN];struct tt{ int x,y,z,step;};queueq;int xx[6]={0,0,1,-1,0,0};int yy[6]={1,-1,0,0,0,0};int zz[6]={0,0... Read More
posted @ 2014-02-16 22:26 laiba2004 Views(147) Comments(0) Diggs(0) Edit