Description: 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" .
To Search:
File list (Check if you may need any files):
3.1\123.c
...\input.txt
3.1
Download