搜索篇
文章平均质量分 87
田益铭
这个作者很懒,什么都没留下…
展开
-
HDU 1372 Knight Moves
转载请注明出处: 杭电ACM 2014暑期集训队——选拔安排~Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6011 Accepted原创 2014-05-02 14:43:58 · 1036 阅读 · 0 评论 -
CSU 1511: 残缺的棋盘(BFS啊 )
CSU 1511: 残缺的棋盘(BFS啊 )原创 2014-12-06 19:27:44 · 1375 阅读 · 0 评论 -
URAL 1145. Rope in the Labyrinth(两次BFS啊 )
URAL 1145. Rope in the Labyrinth(两次BFS啊 )原创 2015-02-08 21:06:08 · 1046 阅读 · 0 评论 -
zoj 3332 Strange Country II (dfs)
zoj 3332 Strange Country II (dfs)原创 2014-04-15 17:24:50 · 1400 阅读 · 1 评论 -
HDU 4597(记忆化搜索 dfs 参考)
HDU 4597(记忆化搜索 dfs 参考)原创 2015-05-09 20:28:35 · 1232 阅读 · 0 评论 -
FZU 2196 Escape (两次BFS)
题目练级:http://acm.fzu.edu.cn/problem.php?pid=2196Problem Description小明进入地下迷宫寻找宝藏,找到宝藏后却发生地震,迷宫各处产生岩浆,小明急忙向出口处逃跑。如果丢下宝藏,小明就能迅速离开迷宫,但小明并不想轻易放弃自己的辛苦所得。所以他急忙联系当程序员的朋友你(当然是用手机联系),并告诉你他所面临的情况,...原创 2015-05-04 20:48:58 · 798 阅读 · 0 评论 -
POJ 3170 Knights of Ni(两次BFS)
题目链接:http://poj.org/problem?id=3170DescriptionBessie is in Camelot and has encountered a sticky situation: she needs to pass through the forest that is guarded by the Knights of Ni. In order...原创 2015-07-13 11:13:32 · 1091 阅读 · 0 评论 -
HDU 5336 XYZ and Drops(模拟十滴水游戏 BFS)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5336Problem DescriptionXYZ is playing an interesting game called "drops". It is played on ar∗cgrid. Each grid cell is either empty, or occupi...原创 2015-08-02 11:06:05 · 1047 阅读 · 0 评论 -
dfs
DFS原创 2014-02-22 09:31:26 · 994 阅读 · 0 评论 -
HDU 1016 Prime Ring Problem(经典DFS )
HDU 1016 Prime Ring Problem(经典DFS )原创 2014-02-22 09:34:26 · 1132 阅读 · 0 评论 -
UVA 10131 Is Bigger Smarter?(记忆化搜索)
UVA 10131 Is Bigger Smarter?(记忆化搜索)原创 2014-03-29 10:05:06 · 1039 阅读 · 0 评论 -
hdu 1010 Tempter of the Bone(dfs)
hdu 1010 Tempter of the Bone(dfs)原创 2014-04-14 21:59:28 · 986 阅读 · 0 评论 -
FZU Problem 2150 Fire Game (双起点BFS )
题目链接:http://acm.fzu.edu.cn/problem.php?pid=2150Problem DescriptionFat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each...原创 2014-12-03 19:21:56 · 1338 阅读 · 0 评论 -
熊猫的故事(DFS)
转载请注明出处:http://blog.csdn.net/u012860063Description:‘熊猫’和‘坦克’他们经常比,然而熊猫每次都输。这次熊猫看到一个题目,他又想和‘坦克’比。熊猫当然不想再输一次,于是他请你这个聪明的程序员帮助他,使他能比‘坦克’可以更快的得出答案。下面是题目:有 n 个数字,这 n 个数字为 a1,a2,a3,……,an。这 n ...原创 2014-02-22 20:19:05 · 1189 阅读 · 0 评论 -
hdu 2102 A计划(双层BFS)(详解)
hdu 2102 A计划(双层BFS)(详解)原创 2014-07-05 16:23:53 · 1323 阅读 · 0 评论 -
HDU 5025 Saving Tang Monk(BFS+状压)
HDU 5025 Saving Tang Monk(BFS+状压)原创 2014-09-22 18:25:55 · 1562 阅读 · 0 评论 -
poj2243 && hdu1372 Knight Moves(BFS)
poj2243&&hdu1372 Knight Moves(BFS)原创 2014-07-14 15:02:01 · 1122 阅读 · 0 评论 -
poj 1606 Jugs(广搜BFS+路径输出)
poj1606 Jugs(广搜BFS+路径输出)原创 2014-07-14 21:00:35 · 2021 阅读 · 0 评论 -
poj 3414 Pots(广搜BFS+路径输出)
poj3414 Pots(BFS+路径输出)原创 2014-07-14 20:18:04 · 4906 阅读 · 1 评论 -
HDU 5012 Dice (bfs + 记忆化搜索)
HDU 5012 Dice(记忆化搜索)原创 2014-09-14 19:44:00 · 1906 阅读 · 4 评论 -
HDU 3152 Obstacle Course(BFS+优先队列 重载)
HDU 3152 Obstacle Course(BFS+优先队列 重载)原创 2014-10-07 21:04:19 · 1567 阅读 · 0 评论 -
HDU 1495 非常可乐(BFS & STL)
HDU 1495 非常可乐(BFS)原创 2014-09-11 09:57:39 · 1421 阅读 · 0 评论 -
HDU 3137 No Left Turns(BFS)
HDU 3137 No Left Turns(BFS)原创 2014-11-05 21:41:47 · 1510 阅读 · 0 评论 -
ZOJ 1002 Fire Net(DFS)
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=2Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each rep...原创 2014-11-30 19:19:38 · 1661 阅读 · 0 评论 -
ZOJ 1711 Sum It Up(DFS)
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=711Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For exa...原创 2014-11-30 22:16:45 · 1073 阅读 · 0 评论 -
BFS(模板)
转载请注明出处:http://blog.csdn.net/u012860063BFS#include #include #include #include using namespace std;#include #define M 1000struct node{int x,y; //点的坐标int step;//记录走到当前点的步数};int xx[8]原创 2014-05-02 14:41:24 · 2288 阅读 · 0 评论