Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32696 Accepted Submission(s): 14788
Problem 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.
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.
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.
Sample Input
abcfbc abfcab programming contest abcd mnp
Sample Output
4 2 0
Source
没什么好说的,就是一个经典LCS问题,设dp[I][j]是S串的前I个字符和T串前j个字符的LCS,那么对于每一次进行比较的字符,我们都有两个选择,如果相等,那么dp[I][j] = dp[I-1][j-1] + 1,如果不相等,我们自然要取最大LCS进行替换当前dp[I]j[j],所以dp[I][j] = Max(dp[I][j-1],dp[I-1][j-1])
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 505;
const int Inf = 0x3f3f3f;
int dp[maxn][maxn];
char s[maxn];
char t[maxn];
int main()
{
while(~scanf("%s%s",&s,&t))
{
int len1 = strlen(s);
int len2 = strlen(t);
memset(dp,0,sizeof(dp));
for(int i=0;i<len1;i++)
{
for(int j=0;j<len2;j++)
{
if(s[i] == t[j])
dp[i+1][j+1] = dp[i][j] + 1;
else
dp[i+1][j+1] = max(dp[i+1][j],dp[i][j+1]);
}
}
printf("%d\n",dp[len1][len2]);
}
}