Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24032 Accepted Submission(s): 10616
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 20
题目意思:求公共子序列的长度。
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #include<vector> #include<queue> #include<map> #include<stack> #define rt return #define bk break #define ct continue #define sf scanf #define pf printf #define ms memset #define si(n) sf("%d",&n) #define pi(n) pf("%d\n",n) #define REP0(i,n) for(int i=0;i<(n);i++) #define REP1(i,n) for(int i=1;i<=(n);i++) #define REP(i,s,n) for(int i=s;i<=(n);i++) #define db double #define op operator #define pb push_back #define LL long long #define INF 0x3fffffff #define eps 1e-8 #define PI acos(-1) #define maxn 1010 using namespace std; char s1[maxn],s2[maxn]; int dp[maxn][maxn]; int solve(){ ms(dp,0,sizeof dp); int len1=strlen(s1); int len2=strlen(s2); for(int i=0;i<len1;i++){ for(int j=0;j<len2;j++){ if(s1[i]==s2[j]){ if(i&&j)dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=1; } else if(i&&j)dp[i][j]=max(dp[i-1][j],dp[i][j-1]); else if(i)dp[i][j]=dp[i-1][j]; else if(j)dp[i][j]=dp[i][j-1]; } } rt dp[len1-1][len2-1]; } int main(){ #ifdef ACBang // freopen("in.txt","r",stdin); #endif while(~sf("%s%s",s1,s2)){ int ans=solve(); pi(ans); } rt 0; }