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, x
ij= 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 mnpSample Output
4
2
0
题目大意&&解题思路:给出两个字符串,求最长公共子串的长度。利用动态规划思想,列出转移方程。s1[i]==s2[j]时,只需要在原先前缀的基础上加上1,即d[i][j]=d[i-1][j-1]+1。当s1[i]!=s2[j]时,无非有两种“止损”方式,取s1的前缀和s2的最长公共串或取s2的前缀和s1的最长公共串,即d[i][j]=max(d[i-1][j],d[i][j-1])。
LCS模版题,必需强迫自己熟练默写QaQ
Code:
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
const int maxn=1005;
char s1[maxn],s2[maxn];
int d[maxn][maxn];
int LCS(char *a,char *b){
int n=strlen(a+1);
int m=strlen(b+1);
memset(d,0,sizeof(d));
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(a[i]==b[j]) d[i][j]=d[i-1][j-1]+1;
else {
d[i][j]=max(d[i-1][j],d[i][j-1]);
}
}
}
return d[n][m];
}
int main(){
while(~scanf("%s %s",s1+1,s2+1)){
cout<<LCS(s1,s2)<<endl;
}
return 0;
}