设计一个算法求出全部的LCS，分析最坏情况。 用”会计方法”证明,利用b[i,j]来求所有LCS的算法 在最坏情况下时间复杂度为O( )。 -Designed an algorithm to find all of the LCS, the worst-case analysis. Use " accounting methods" to prove the use of b [i, j] to seek all the LCS algorithm in the w

LCS（最长公共子序列）能够输出所有的最长公共子序列-LCS (longest common subsequence) to output all of the longest common subsequence

找出所有符合条件的的最长公共子序列，应用C++编写-To identify all eligible longest common subsequence, application C++ to prepare