dfs&&bfs
文章平均质量分 77
WudHHH
这个作者很懒,什么都没留下…
展开
-
依旧是回溯法,还有深搜妙用极其深入理解
#include #include #include #include #include #include #include #define MAX 30using namespace std;int n;struct P{ int x; int nextx; int flag;}s[MAX];int ans[MAX];bool is_prime原创 2017-01-12 00:20:01 · 524 阅读 · 0 评论 -
dfs——回溯法求最短路径
#include #include #include #include #include #include #include #define MAX 150using namespace std;int A,B,C;struct P{ int x,y; int nextx,nexty; int cz;//操作 int flag; int原创 2017-01-11 01:30:33 · 1984 阅读 · 0 评论 -
搜索 bfs 路径
#include #include #include #include #include #include #include #define MAX 30#define INF 1e8using namespace std;char maze[5][5];int d[5][5];int move1[4] = {1,0,-1,0},move2[4] = {0,1,0,-1}原创 2017-01-10 15:18:31 · 392 阅读 · 0 评论 -
3维迷宫的bfs
#include #include #include #include #include #include #include #define MAX 30#define INF 1e8using namespace std;int L,R,C;char maze[MAX][MAX][MAX];int d[MAX][MAX][MAX];int move1[6][3] =原创 2017-01-10 14:25:57 · 386 阅读 · 0 评论 -
宽度优先搜索
#include #include #include #include #include #include #include #define MAX 300#define INF 1e8using namespace std;typedef pair P;int N,M;char maze[MAX][MAX];int yx,yy;//y的起始坐标int mx,my;/原创 2017-01-10 00:44:38 · 372 阅读 · 0 评论 -
Fire
#include #include #include #include #include #include #include #define MAX 1005#define INF 1e8using namespace std;int R,C,k;typedef pair P;char s[MAX][MAX];int Q[MAX][MAX];int jx,jy,fx[原创 2017-01-12 21:58:04 · 370 阅读 · 0 评论 -
dfs好题一道
There are n Doge Planets in the Doge Space. The conqueror of Doge Space is Super Doge, who is going to inspect his Doge Army on all Doge Planets. The inspection starts from Doge Planet 1 where DOS (Do原创 2017-01-13 01:01:54 · 471 阅读 · 0 评论 -
深搜水题poj2488
DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it is原创 2017-02-24 21:48:14 · 444 阅读 · 0 评论 -
(Vivid Vervet )dfs——一道好题(抓住剪枝)hdu1010
#include #include #include #include #include #include #include #define MAX 7#define INF 1e8using namespace std;int sx,sy,ex,ey;char maze[MAX][MAX];int N,M,T;int move1[4]={1,0,-1,0},move2原创 2017-01-10 13:46:10 · 598 阅读 · 0 评论