子序列
文章平均质量分 81
sandra-hehe
这个作者很懒,什么都没留下…
展开
-
最大连续子序列问题(含环路)
Prob III. More than MSP In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers which has the largest sum. For examp原创 2014-03-19 10:34:01 · 556 阅读 · 0 评论 -
LIS
Prob I. Just LIS You are to find the length of the longest increasing subsequence (LIS) of a given sequence A whose length is n. Input There multiple test cases. Each case contains n+1 inte原创 2014-03-20 19:32:27 · 377 阅读 · 0 评论