LCS
苍山洱海胖
没有人愿意等不努力的你
展开
-
【hdu 1159】Common Subsequence(LCS模板)
Common Subsequence A 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 the原创 2017-08-07 17:58:28 · 206 阅读 · 0 评论 -
【hdu 1029】Ignatius and the Princess IV
Ignatius and the Princess IV "OK, you are not too bad, em... But you can never pass the next test." feng5166 says. "I will tell you an odd number N, and then N integers. There will be a sp原创 2017-08-07 10:17:56 · 167 阅读 · 0 评论 -
【最大子序列的和】
最大子序列的和 问题描述: 求取数组中最大连续子序列和,例如给定数组为A={1, 3, -2, 4, -5}, 则最大连续子序列和为6,即1+3+(-2)+ 4 = 6。 思路: 因为最大 连续子序列和只可能是以位置0~n-1中某个位置结尾。当遍历到第i个元素时,判断在它前面的连续子序列和是否大于0,如果大于0,则以位置i结尾的最大连续子序列和为元素i和前门的连续子序列和相加;原创 2017-08-07 15:10:33 · 226 阅读 · 0 评论