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" .

3.1\123.c
...\input.txt
3.1

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．