最长公共子序列
Common Subsequence POJ - 1458
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 mnp
Sample Output
4
2
0
题目分析:
题目的意思就是求最长公共子序列的长度,现在假设有字符串a,b,则:
定义状态:dp[i][j]:字符串a的前i个字符和字符串b的前j个字符的最长公共子序列的长度
则有
当 a[i]==b[j] 时,dp[i][j]=dp[i-1][j-1]+1
否则,dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
初始状态:
dp[0][i]=dp[i][0]=0
Accepted code:
#include<iostream>
#include<cstring>
#include<string>
using namespace std;
const int maxn=1005;
int dp[maxn][maxn];
int main()
{
string a,b;
while(cin>>a>>b)
{
memset(dp,0,sizeof(dp));
for(int i=0;i<(int)a.size();i++)
{
for(int j=0;j<(int)b.size();j++)
{
if(a[i]!=b[j])
dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);
else
dp[i+1][j+1]=dp[i][j]+1;
}
}
cout<<dp[a.size()][b.size()]<<endl;
}
}