1458:Common Subsequence（最長公共子序列）
阿新 • • 發佈：2019-02-07
Common Subsequence
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, xijInput 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 Sample Input abcfbc abfcab programming contest abcd mnp Sample Output 4 2 0 Source |
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxl = 1005; char a[maxl],b[maxl]; int dp[maxl][maxl]; void solve(){ while(scanf("%s %s",a,b) == 2){ int la = strlen(a),lb = strlen(b); memset(dp,0,sizeof(dp)); for(int i = 0;i < la;i++){ for(int j = 0;j < lb;j++){ if(a[i] == b[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[la][lb]); } } int main() { solve(); return 0; }