最长递增子序列 Longest Increasing Subsequence (LIS)
题目描述:The longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. F
原创
2015-06-10 11:18:17 ·
448 阅读 ·
0 评论