Common Subsequence
Time Limit: |
|
Memory Limit: |
Total Submissions: |
|
Accepted: |
Description
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, ..., ik > of indices of X such that for all j = 1,2,...,k, xij
= zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
Input
The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.
Output
For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
Sample Input
abcfbc
abfcab
programming
contest
abcd
mnp
Sample Output
4
2
0
DP
的经典应用
:
求最长公共字串
.
转移方程
:
(res[i][j]:
表示
stringa
的前
i
个字符和
stringb
的前
j
个字符的最长公共字串长度
)
res[i][j]=0
(i==0||j==0)
res[i][j]=res[i-1][j-1]+1
(stringa[i]==stringb[j])
res[i][j]=max(res[i][j-1],res[i-1][j])
(stringa[i]!=stringb[j])
代码如下
: