随笔分类 -  UVa OJ Solutions

Solutions to problems on https://uva.onlinejudge.org/index.php.
[UVa OJ] Longest Common Subsequence
摘要：This is the classic LCS problem. Since it only requires you to print the maximum length, the code can be optimized to use only O(m) space (seehere).My... 阅读全文
posted @ 2015-06-14 23:17 jianchao-li 阅读(255) 评论(0) 推荐(0) 编辑