DFS
_花花
这个作者很懒,什么都没留下…
展开
-
HDU1035 Robot Motion
Robot MotionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5000 Accepted Submission(s): 2311Problem DescriptionA robot h原创 2013-07-18 11:22:22 · 787 阅读 · 0 评论 -
湖南省第六届大学生程序设计大赛原题 F Biggest Number (UVA1182)
Biggest Numberhttp://acm.hust.edu.cn/vjudge/contest/view.action?cid=30851#problem/F解题思路:DFS(检索)+BFS(探路)=强剪枝 一看就知道是搜索题,只是,要是DFS裸搜,真的会超时。时间,非常紧! 做该题的时候,要无时无刻不忘剪枝,抓住一切剪枝的机会,剪吧!(1)用flag记录当前检索的值与当前已经检索到的最大值的关系,一但有机会,就要剪掉那些检索到的值会比当前最大值要小的“残枝败叶”原创 2013-09-03 21:31:26 · 1446 阅读 · 0 评论 -
HDU1045 Fire Net
HDU1045 Fire Nethttp://acm.hdu.edu.cn/showproblem.php?pid=1045解题思路:本题是加条件变形后的搜索题,中间有检查的成份,弄的题目有点恶心的感觉。给定一个n*n的地图,图中有“。”和“X”,"X"表示墙,“。”表示空地。可以在空地上修建炮台,当时互相可见的炮台(同行或同列,且中间没有墙隔开)就会互相摧毁对方,造成事故。要求在图中的空地上修建炮台,要使炮台不会互相攻击。要求出最多能修建多少个炮台。地图的大小n<=4.虽然题目比较恶心,还好数原创 2013-08-30 20:32:14 · 1217 阅读 · 0 评论 -
poj2245 Lotto
poj2245 Lottohttp://poj.org/problem?id=2245解题思路:本题为深度优先搜索基础题,没有很多的条件,只要从前到后,凑足6个数即可。给出一个n,后面是n个用空格隔开的数字最后一组测试案例的n为0,不用处理最后一组数据。要求从前到后找出任意一组6个数,输出所有满足要求的数(组)。每组数占一行,两组测试案例的输出中间隔一个空行,最原创 2013-08-30 08:44:13 · 980 阅读 · 0 评论 -
POJ1088 滑雪
POJ1088 滑雪解题思路:本题为记忆深度优先搜索+动态规划+枚举题目,不能舍弃以前已求得的数据,必须用数组记录后面遇到时,直接运用,不必再求,可以节省时间空间。由已知求未知,层层递归是动态规划的思想,其实觉得有点像深搜,不过想来,动归本来就是剪了枝的深搜,本来就是一家人啦。 亲们不要看到题目时间只有一秒钟就担惊受怕的啊,虽然题目说了n<=100,再看看输入要求,每次测试只有1组案例,也就是说,一组案例在一分钟之内运行完成即可。我当时就是看到这时间,没敢做这题,后面悔死了。原创 2013-08-07 16:56:05 · 1250 阅读 · 0 评论 -
JSU 2013 Summer Individual Ranking Contest - 5
JSU 2013 Summer Individual Ranking Contest - 5一、套题分析:该套题难度不大,适合入门有一定基础的ACMer用于练习。二、考点:逻辑思维、基础数论、数位运算基础、深度优先搜索、动态规划。三、竞赛形式:个人赛四、解题时间:3小时五、题目情况: A. BNU ACM校队时间安排表 B. 硬币水题II C. 沙漠之旅 D. Invading system E. Sereja an原创 2013-08-16 15:44:30 · 1778 阅读 · 0 评论 -
HDU1426 Sudoku Killer
Sudoku KillerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3144 Accepted Submission(s): 991Problem Description自从2006年3月10日至11日的原创 2013-07-22 22:23:30 · 1113 阅读 · 0 评论 -
HDU1044 Collect More Jewels(BFS+DFS+地图压缩)
本题需要做地图压缩,要是直接(BFS+DFS)搜索的话,思路会很混乱,还会超时。 剪枝:只要剪掉无法到达终点和已经遍历过的的枝节即可。原创 2013-07-24 10:20:44 · 1353 阅读 · 0 评论 -
HDU2614 Beat
BeatTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 349 Accepted Submission(s): 225Problem DescriptionZty is a man that always fu原创 2013-07-23 13:48:15 · 1404 阅读 · 0 评论 -
HDU2141 Can you find it?
Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 7927 Accepted Submission(s): 2062Problem DescriptionGive you thr原创 2013-07-21 11:30:50 · 881 阅读 · 0 评论 -
HDU1015 Safecracker
SafecrackerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6326 Accepted Submission(s): 3159Problem Description=== Op tech briefi原创 2013-07-21 10:17:29 · 835 阅读 · 0 评论 -
HDU1010 Tempter of the Bone
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51836 Accepted Submission(s): 13942Problem DescriptionThe dogg原创 2013-07-21 10:00:36 · 812 阅读 · 0 评论 -
HDU1258 Sum It Up
Sum It UpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2966 Accepted Submission(s): 1483Problem DescriptionGiven a specified to原创 2013-07-21 09:33:00 · 858 阅读 · 0 评论 -
HDU2514 Another Eight Puzzle
Another Eight PuzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 716 Accepted Submission(s): 442Problem DescriptionFill the fo原创 2013-07-16 18:09:55 · 857 阅读 · 0 评论 -
HDU2660 Accepted Necklace
Accepted NecklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2235 Accepted Submission(s): 868Problem DescriptionI have N prec原创 2013-07-21 09:24:31 · 925 阅读 · 0 评论 -
HDU1518 Square
SquareTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5710 Accepted Submission(s): 1812Problem DescriptionGiven a set of sticks原创 2013-07-21 09:42:21 · 827 阅读 · 0 评论 -
HDU2616 Kill the monster
Kill the monsterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 637 Accepted Submission(s): 448Problem DescriptionThere is a moun原创 2013-07-18 10:08:17 · 1272 阅读 · 0 评论 -
HDU1035 Prime Ring Problem
Prime Ring Problem Time Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 14 Accepted Submission(s) : 10Font: Times New Roman | Verdana | Georgia原创 2013-07-18 11:29:02 · 959 阅读 · 2 评论 -
codeforces-379C. New Year Ratings Change
codeforces-379C. New Year Ratings Change原理=北大OJ1088滑雪,叫记忆DP吧,就是深搜的感觉,只是边走边做记号,用函数的回溯。。。。数据太大?开不了那么大的数组?用数据离散化,容器map。就是,走过的地方,就留标记,标记后面有多少步已经走过了,下次再走到这个地方,就直接跳过标记不再走,可以节省时间。原创 2014-01-05 20:31:49 · 1717 阅读 · 0 评论