摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=1241简单的搜索题。#include #include #include struct abc
{ int x,y;
} queue[10005],e;
int vis[105][105],map[105][105];
int dir[8][2] = {1,0,1,1,0,1,-1,1,-1,0,-1,-1,0,-1,1,-1};
int n,m;
void bfs(int sx,int sy)
{ int start,tail,x,y; //int flag = 0... 阅读全文
posted @ 2013-07-25 19:31
cnwsycf
阅读(111)
评论(0)
推荐(0)

浙公网安备 33010602011771号