动态规划
lxfstyle
这个作者很懒,什么都没留下…
展开
-
POJ 1088 滑雪
滑雪Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 44902Accepted: 16095DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516原创 2011-02-04 16:33:00 · 328 阅读 · 0 评论 -
HDU 1087 简单DP
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8054 Accepted Submission(s): 3255Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping原创 2011-02-06 13:18:00 · 316 阅读 · 0 评论 -
POJ 1458 最长公共子序列
Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 22315Accepted: 8513DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence原创 2011-03-02 10:28:00 · 297 阅读 · 0 评论 -
hdu 1231
最大连续子序列<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 7772 Accepted Submission(s): 3108<br /><br />Problem Description给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ..., <br />原创 2011-03-04 10:46:00 · 353 阅读 · 0 评论