majcos的专栏

努力寻找方向

LCIS

A longest common increasing subsequence of A and B is a common increasing subsequence of the maximum length. A straightforward O(mn2)-time algorithm for this problem is to sort the shorter sequence, and then find a longest common subsequence among the two sequences and the sorted sequence.
阅读更多
文章标签: algorithm
个人分类: Algorithms
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭