Description: Sequence Z = <B，C，D，B> Is a sequence X = <A，B，C，B，D，A，B> Sub-sequence, the corresponding sequence of increasing subscript < 2,3,5,7> . In general, given a sequence X = <x1,x2,…,xm> , Another sequence Z = <z1,z2,…,zk> Subsequence of X, there is a strictly increasing sequence < i1,i2,…,ik> subscript such that for all j = 1,2, ..., k so that the first j elements Z and X in the ij zj the same elements. Given two sequences X and Y, when another sequence Z is X, Y sequence is the sequence when 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):
fad\a.cpp
...\fad.dsp
...\fad.dsw
...\fad.ncb
...\fad.opt
...\Debug
fad
Download