最长公共子序列 问题ACM题目

如果序列 { s1, s2, ……, sk } 是序列 { a1, a2, ……, an } 的子序列，又是序列 { b1, b2, ……, bm } 的子序列，则称序列 s 为序列 a 和 序列 b 的公共子序列。在 a 和 b 的所有公共子序列中，长度最长者称为最长公共子序列。



本题对于给定的两个整数序列，请求其最长公共子序列的长度

-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