随笔分类 -  04.动态规划

摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2602 Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man lik 阅读全文
posted @ 2017-03-03 15:16 Dilthey 阅读(211) 评论(0) 推荐(0)
摘要:Problem Description 穿过幽谷意味着离大魔王lemon已经无限接近了!可谁能想到,yifenfei在斩杀了一些虾兵蟹将后,却再次面临命运大迷宫的考验,这是魔王lemon设下的又一个机关。要知道,不论何人,若在迷宫中被困1小时以上,则必死无疑!可怜的yifenfei为了去救MM,义无 阅读全文
posted @ 2017-03-03 12:42 Dilthey 阅读(190) 评论(0) 推荐(0)
摘要:题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=2955 Problem Description The aspiring Roy the Robber has seen a lot of American movies, and knows 阅读全文
posted @ 2017-03-03 08:43 Dilthey 阅读(181) 评论(0) 推荐(0)
摘要:Problem Description 在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的: 有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少? 已经告诉你了,这是个DP的题目,你能AC吗? Input 输入数据首先包括一个整数C,表示 阅读全文
posted @ 2017-03-02 00:03 Dilthey 阅读(190) 评论(0) 推荐(0)
摘要:Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7 阅读全文
posted @ 2017-03-01 23:21 Dilthey 阅读(158) 评论(0) 推荐(0)
摘要:Largest Rectangle in a Histogram Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17635 Accepted 阅读全文
posted @ 2017-03-01 22:28 Dilthey 阅读(194) 评论(0) 推荐(0)