关闭

LCIS

552人阅读 评论(0) 收藏 举报
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.
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:224512次
    • 积分:4015
    • 等级:
    • 排名:第8000名
    • 原创:173篇
    • 转载:16篇
    • 译文:0篇
    • 评论:20条
    文章分类
    最新评论