- 博客(4)
- 收藏
- 关注
RSS订阅原创 poj 2251 (bfs)
#include #include #include #include #define maxm 35 using namespace std; int n, m, t; char map[maxm][maxm][maxm]; bool visit[maxm][maxm][maxm]; int dir[6][3] ={0,-1,0,0,1,0,0,0,-1,0,0,1,1,0,0,-1,0,0}
2014-07-17 22:02:40
502
原创 BFS
#include #include #include #include using namespace std; int n, m; char map[205][205]; bool visit[205][205]; int dir[4][2] ={-1,0,1,0,0,-1,0,1}; int bx, by; struct point{ int x, y, step; friend boo
2014-07-17 21:10:09
360
原创 hdu2660(dfs)
Accepted Necklace Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2536 Accepted Submission(s): 1003 Problem Description I have N
2014-07-16 16:04:59
469
原创 hncu 1101(bfs)
#include #include #include #include using namespace std; int bx, by, ex, ey; bool visit[8][8]; int dir[8][2]={-1,-2,-2,-1,-2,1,-1,2,1,2,2,1,2,-1,1,-2}; struct node{ int x, y, step; };
2014-07-15 23:02:54
427
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人