搜索
MiniSheep_CS
编程者如上帝,可以创造万物。
展开
-
迷宫问题(八个方向寻找)DFS
迷宫问题(八方向) input: 1 6 8 0 1 1 1 0 1 1 1 1 0 1 0 1 0 1 0 0 1 0 0 1 1 1 1 0 1 1 1 0 0 1 1 1 0 0 1 1 0 0 0 0 1 1 0 0 1 1 0 output: YES (1,1) (2,2) (3,1) (4,1) (5,2) (5,3) (6,4) (6,5) (5,6) (4,原创 2014-11-04 14:16:15 · 3292 阅读 · 0 评论 -
Sticks POJ1011 hdu1455 (深度优先搜索DFS)
Sticks Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 122528 Accepted: 28390 Description George took sticks of the same length and cut them randomly until a原创 2014-11-15 21:33:10 · 788 阅读 · 0 评论 -
POJ1088 滑雪(递归 + 记忆化搜索)
滑雪 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 80871 Accepted: 30152 Description Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等原创 2015-04-16 11:55:02 · 596 阅读 · 0 评论 -
POJ2251 Dungeon Master(搜索BFS)
Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18557 Accepted: 7216 Description You are trapped in a 3D dungeon and need to find the quicke原创 2015-04-16 19:58:34 · 354 阅读 · 0 评论 -
POJ3278 Catch That Cow(广搜BFS)
Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 54969 Accepted: 17198 Description Farmer John has been informed of the location of a fugitiv原创 2015-05-30 20:27:41 · 391 阅读 · 0 评论 -
poj1014 Dividing(递归,多重背包)
Dividing Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 62888 Accepted: 16287 Description Marsha and Bill own a collection of marbles. They want to split原创 2015-05-30 15:43:23 · 920 阅读 · 5 评论 -
POJ 1753 Flip Game(暴力+搜索递归)
Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 33357 Accepted: 14577 Description Flip game is played on a rectangular 4x4 field with two-sided p原创 2015-06-02 17:18:56 · 505 阅读 · 0 评论 -
POJ1915 (Knight Moves) BFS
Knight Moves Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22994 Accepted: 10752 Description Background Mr Somurolov, fabulous chess-gamer indeed, asse原创 2015-07-05 13:46:18 · 421 阅读 · 0 评论 -
BFS遍历图代码
#include #include #include #include #include using namespace std; const int maxn = 1005; vector vec[maxn]; queue que; bool vis[maxn]; int step[maxn]; void BFS(int s) { int i; int ele,ele1; que.p原创 2015-07-13 19:22:18 · 403 阅读 · 0 评论