Description: Sequence Z = <B，C，D，B> Is a sequence X = <A，B，C，B，D，A，B> Sub-sequences, the corresponding increment subscript sequence " 2,3,5,7" . In general, given a sequence X = <x1,x2,…,xm> , Another sequence Z = <z1,z2,…,zk> Is a sub-sequence of X is defined as the existence of a strictly increasing sequence of < i1,i2,…,ik> subscript such that for all j = 1,2, ..., k so that the first j elements in Z and X in the zj first ij the same elements. Given two sequences X and Y, when another sequence Z is X is Y sub-sequence of sub-sequences, that Z is a sequence of X and Y of the common sub-sequence of. Your task is: given two sequences X, Y, seeking X and Y of the longest common subsequence Z.
To Search:
File list (Check if you may need any files):
zixulie
.......\Debug
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\.....\zixulie.exe
.......\.....\zixulie.ilk
.......\.....\zixulie.obj
.......\.....\zixulie.pch
.......\.....\zixulie.pdb
.......\zixulie.cpp
.......\zixulie.dsp
.......\zixulie.dsw
.......\zixulie.ncb
.......\zixulie.opt
.......\zixulie.plg
Download