3.1 最长公共子序列问题

最长公共子序列（动态规划）

实验数据：input.txt

X={A,B,C,B,D,A,B}

Y={B,D,C,A,B,A}

——要求给出X、Y的最长公共子序列Z，程序运行结束时，将计算结果输出到文件output.txt中。输出文件中包含问题的答案：找不到公共子序列时给出“null” 。

-3.1 the longest common subsequence problems longest common subsequence (dynamic programming) the experimental data: the input.txt X-= {A, B, C, B, and D,, A, B,}　Y = {B, D, C, A B}- required to give the X, Y longest common subsequence Z, the end of the program is running, will calculate the resulting output to the file output.txt. The output file contains the answer to the question: can not find common sub-sequence is given " null" .