DP
文章平均质量分 70
「已注销」
这个作者很懒,什么都没留下…
展开
-
POJ1458Common Subsequence(LCS)
DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there exists a原创 2016-07-24 19:18:21 · 235 阅读 · 0 评论 -
POJ2533:Longest Ordered Subsequence(LIS)
DescriptionA numeric sequence of ai is ordered ifa1 a2 aN. Let the subsequence of the given numeric sequence (a1,a2, ..., aN) be any sequence (ai1,ai2, ..., aiK), where 1 i1 i2 iK N. For example原创 2016-07-24 14:29:10 · 256 阅读 · 0 评论 -
POJ 1163:The Triangle(递推)
Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that st原创 2016-07-24 12:28:29 · 512 阅读 · 0 评论 -
POJ1088 滑雪(DP)
DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 2原创 2016-07-26 21:13:15 · 244 阅读 · 0 评论