This is a problem appeared in today's Pacific NW Region Programming Contest during which no one solved it. It is problem B and the complete problem set is here: This is a problem appeared in today's Pacific N
阅读背景：
O(n ^ 2)(或O(n ^ 2 lg(n))?)算法计算最长公共子序列(LCS)的两个“环”字符串
来源：互联网
分享到：
