Description: The question of the longest common sub-sequence if the sequence of ACM topics (s1, s2, ... ..., sk) is a sequence (a1, a2, ... ..., an) of the sequence is also sequence (b1, b2, ... ..., bm) of sequence, said sequence s to sequence a and sequence b of the public sequence. A and b in all the common sub-sequences, known as the longest length of the longest common sub-sequence. This title for a given sequence of two integers, the request of the longest common sub-sequence of length
To Search:
File list (Check if you may need any files):
最长公共子序列AC.doc
Download