摘要: The Longest Increasing Subsequence (LIS) problem requires us to find a subsequence t of a given sequence s, such that t satisfies two requirements:Ele... 阅读全文
posted @ 2015-06-15 11:46 jianchao-li 阅读(265) 评论(0) 推荐(0) 编辑