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.
Input
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
题意:
求给定两个字符串的最长公共子序列(非连续)
解题思路:
DP就完事了
代码:
#include<iostream>
#include<string>
#define clr(a,b) memset(a,b,sizeof(a))
#define rep(i,s,t) for(int i=s;i<=t;++i)
#define max(a,b) a>b?a:b
#define maxn 1001
using namespace std;
int dp[maxn][maxn];
int lcs(string s1,string s2){
clr(dp,0);
int l1=s1.size(),l2=s2.size();
s1=' '+s1,s2=' '+s2;
rep(i,0,l1)
rep(j,0,l2){
if(i==0||j==0)dp[i][j]=0;
else if(s1[i]==s2[j]) dp[i][j]=dp[i-1][j-1]+1;
else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
return dp[l1][l2];
}
int main(){
string s1,s2;
while(cin>>s1>>s2)cout<<lcs(s1,s2)<<endl;
return 0;
}