随笔分类 -  最长子序列

摘要：Problem Description：In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subseque... 阅读全文

摘要：Problem Description:You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its i... 阅读全文

摘要：Description:A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequenc... 阅读全文

摘要：Problem DescriptionGiven 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)... 阅读全文