![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM-搜索
文章平均质量分 77
gk1988
这个作者很懒,什么都没留下…
展开
-
PKU-1077 Eight (八数码单向BFS+HASH)
原题链接 http://poj.org/problem?id=1077 EightDescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 slidin转载 2013-05-15 17:36:08 · 508 阅读 · 0 评论 -
PKU-1077 Eight (八数码之A*算法)
原题链接 http://poj.org/problem?id=1077EightDescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding转载 2013-05-18 12:49:19 · 521 阅读 · 0 评论 -
PKU-1273 Drainage Ditches (网络最大流)
原题链接 http://poj.org/problem?id=1273Drainage DitchesDescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is cover转载 2013-05-21 10:31:17 · 393 阅读 · 0 评论 -
HDU-1010 Tempter of the Bone (DFS)
原题链接 http://acm.hdu.edu.cn/showproblem.php?pid=1010Tempter of the BoneProblem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up,转载 2013-05-13 00:32:27 · 304 阅读 · 0 评论 -
PKU-1011 Sticks (DFS + 剪枝)
原题链接 http://poj.org/problem?id=1011SticksDescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to t转载 2013-05-03 10:42:18 · 325 阅读 · 0 评论 -
PKU-1077 Eight (八数码之双向BFS)
原题链接 http://poj.org/problem?id=1077EightDescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding转载 2013-05-17 13:04:50 · 460 阅读 · 0 评论 -
PKU-1077 Eight (八数码之IDA*)
原题链接:http://poj.org/problem?id=1077EightDescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding转载 2013-05-18 12:49:50 · 591 阅读 · 0 评论 -
PKU-2243 Knight Moves (单BFS、双BFS)
原题链接 http://poj.org/problem?id=2243Knight MovesDescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves转载 2013-05-18 13:44:35 · 394 阅读 · 0 评论