Brute Force__回溯法
shuangde800
这个作者很懒,什么都没留下…
展开
-
UVa 10012 - How Big Is It? 圆排列问题
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=953类型: 回溯原题:Ian's going to California, and he has to pack his things,原创 2012-07-17 00:05:20 · 3373 阅读 · 2 评论 -
UVa 565 - Pizza Anyone?
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=109&page=show_problem&problem=506类型: 暴力枚举,搜索题目:You are responsible for ordering a large pizza for原创 2012-07-20 01:50:49 · 1724 阅读 · 0 评论 -
UVa 208 - Firetruck,双向搜索进行剪枝
208 - Firetruck667516.87%153454.76%题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=144原创 2012-07-17 00:27:26 · 1474 阅读 · 0 评论 -
UVa 11218 - KTV, Rujia Liu的神题(一)
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=112&page=show_problem&problem=2159类型: 暴力回溯原题:One song is extremely popular recently, so you and y原创 2012-07-29 00:34:09 · 2085 阅读 · 0 评论 -
UVa 529 - Addition Chains ,迭代加深搜索+减枝
题目链接:UVA :http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=470POJ : http://poj.org/problem?id=2248类型: 回溯, 迭代加深搜索, 减枝原题:An原创 2012-07-24 00:08:24 · 2398 阅读 · 0 评论 -
UVa 193 - Graph Coloring
193 - Graph Coloring1094622.52%263458.39%题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_proble原创 2012-07-17 22:14:44 · 1407 阅读 · 0 评论 -
UVa 331 - Mapping the Swaps
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=267题目类型: 回溯原题:Sorting an array can be done by swapping certain pairs原创 2012-07-16 18:56:09 · 1492 阅读 · 2 评论 -
uva 1326 Jurassic Remains(中途相遇法)
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=460&page=show_problem&problem=4072题目大意:给n个大写字母组成的字符串,选择尽量多的串,使得每个大写字母都能出现偶数次。思路:一看到Time limit: 18原创 2013-03-28 20:25:46 · 1899 阅读 · 0 评论 -
uva 1267 Network
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=3708思路:先把无根树转化为以s点为根的有根树然后从深度最深的叶子节点开始枚举,如果这个叶子节点还没被覆盖掉的话,那么找它的祖先距离小于等于k的点,然后原创 2013-03-15 13:34:01 · 948 阅读 · 0 评论 -
uva 1352 - Colored Cubes
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=4098刘汝佳书上的例题(训练指南P16),感觉这题很好,尤其是生成旋转序列的方法,这也是这题的重点。学习了。#include#includ原创 2013-03-22 12:07:38 · 1116 阅读 · 0 评论 -
uva 11210 - Chinese Mahjong
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=2151经典的一道暴力回溯题,今天终于做了。。#include#include#include#include#inc原创 2013-03-22 14:49:38 · 1039 阅读 · 0 评论 -
uva 1509 - Leet
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=457&page=show_problem&problem=4255思路:直接的暴力回溯题。字母映射leet,可以用一个数组映射,保存某个字母映射到leet字符串中的下标即可。代码:原创 2013-03-23 16:15:16 · 1259 阅读 · 0 评论 -
uva 10318 - Security Panel
题目链接: 首先,可以确定每个格子只能选一次,因为选任何大于0的偶数次,等于没有效果一样。然后,就可以把这题理解成从r*c的矩阵中选择一些格子进行“点亮”操作,使得最终所有格子都是“亮”的状态。那么,每个格子要么有点亮操作,要么没有,总共复杂度为2^25,显然必须进行减枝。假设从第一行第一列开始,从左往右,从上往下一次依次选择,对于当前所在位置(x, y),它已经不能影响到x-原创 2013-03-24 14:44:29 · 1562 阅读 · 0 评论 -
UVa 165 - Stamps, 连续邮资问题
165 - Stamps261135.85%87977.59%题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108类型: 回溯原题:The gove原创 2012-07-18 00:08:23 · 6037 阅读 · 4 评论 -
UVa 539 - The Settlers of Catan, 简单回溯
539 - The Settlers of Catan376154.91%177393.06%题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_proble原创 2012-07-15 21:17:09 · 1315 阅读 · 0 评论 -
连续邮资问题
转载自: http://blog.csdn.net/jcwkyl/article/details/4137398 By jcwKyl王晓东老师编著的《计算机算法设计与分析》5.12节以“连续邮资问题”为例展示了回溯法的应用。讲解比较简略,对于搜索出一张新的邮票面值后如何更新最大连续邮资区间这一点没有过多的说明。以下是自己对于这一节学习的一点笔记。实际上,关于刚才所说的更新最大转载 2012-07-17 14:31:34 · 5708 阅读 · 0 评论 -
UVa 216 - Getting in Line, 暴力与回溯
216 - Getting in Line725937.24%246372.39%题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&pr原创 2012-07-15 00:37:10 · 2230 阅读 · 0 评论 -
UVa 639 - Don't Get Rooked, 类八皇后问题
639 - Don't Get Rooked391859.67%199790.59%题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&p原创 2012-07-15 01:39:19 · 2466 阅读 · 0 评论 -
UVa 301 - Transportation
301 - Transportation458432.83%133876.08%题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=2原创 2012-07-16 00:03:42 · 1662 阅读 · 1 评论 -
UVa 140 - Bandwidth
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=76类型: 回溯原题:Given a graph (V,E) where V is a set of nodes and E is a原创 2012-07-17 16:41:10 · 2504 阅读 · 0 评论 -
UVa 167 - The Sultan's Successors, 八皇后问题
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=103题目类型: 回溯原题: The Sultan of Nubia has no children, so she has de原创 2012-07-16 19:21:51 · 1940 阅读 · 0 评论 -
UVa 10344 - 23 out of 5, 智力小游戏:算23点
10344 - 23 out of 5700431.42%188273.33%题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&proble原创 2012-07-16 00:47:40 · 3053 阅读 · 10 评论 -
UVa 10624 - Super Number, Rujia Liu的神题(四)
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=112&page=show_problem&problem=1565原题:Don't you think 162456723 very special? Look at the picture below if原创 2012-07-30 00:45:11 · 1588 阅读 · 1 评论 -
UVa 10132 - File Fragmentation
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1073类型: 贪心+回溯原题:The ProblemYour friend, a biochemistry major, tri原创 2012-08-14 10:43:59 · 1203 阅读 · 0 评论 -
UVa 10400 - Game Show Math
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1341类型:回溯原题:A game show in Britain has a segment where it gives its c原创 2012-08-15 00:31:33 · 1799 阅读 · 0 评论 -
uva 10317 - Equating Equations
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=457&page=show_problem&problem=1258 1. 先对等式进行移项,假设原来为1 + 2 = 4 - 5 + 6,那么移动之后就变为了 1 + 2 - 4 + 5 + 6 = 0. 并计算出所原创 2013-03-24 01:02:46 · 1663 阅读 · 0 评论