Description: Given two sequences X and Y, when another sequence Z is X, Y sequence is sub-sequence, said sequence of X and Y Z is the common sub-sequences. Your task is: given two sequences X, Y, X and Y find the longest common subsequence Z
To Search:
File list (Check if you may need any files):
LCS\LCS.CPP
...\LCS.dsp
...\LCS.dsw
...\LCS.plg
...\LCS.sln
...\LCS.suo
...\LCS.vcproj
...\Debug\BuildLog.htm
...\.....\LCS.pdb
...\.....\vc60.idb
...\.....\vc60.pdb
...\.....\vc70.idb
...\.....\vc70.pdb
...\.....\LCS.pch
...\.....\Lcs.obj
...\LCS.ncb
...\LCS.opt
...\Debug
LCS
Download