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.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. 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.
Input
abcfbc abfcab
programming contest
abcd mnp
Output
4
2
0
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
题意;给出两个字符串,求出两个字符串的最长公共子串。
题解;动态规划模板题,dp[i][j],两层循环,表示当前的最大长度。
如果遍历到相等时,if (s1[ i-1 ] == s2[ j-1 ]) dp[i][j] = dp[i - 1][j - 1] + 1;否则取其两边大的一个。
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int dp[1100][1100];
char s1[1000],s2[1000];
int l1,l2;
int main()
{
while(~scanf("%s%s",s1,s2))
{
memset(dp,0,sizeof(dp));
int i,j;
l1=strlen(s1);
l2=strlen(s2);
for(i=0;i<l1;i++)
{
for(j=0;j<=l2;j++)
{
if(s1[i]==s2[j])
dp[i+1][j+1]=dp[i][j]+1;
else
dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);
}
}
printf("%d\n",dp[l1][l2]);
}
return 0;
}