POJ 1458 dp 最大公共子序列

最新推荐文章于 2020-12-09 08:50:01 发布

蒟蒻的ACMer

最新推荐文章于 2020-12-09 08:50:01 发布

阅读量457

点赞数

分类专栏： D P一般看规律

本文链接：https://blog.csdn.net/zp___waj/article/details/49131343

版权

D P一般看规律专栏收录该内容

135 篇文章 0 订阅

订阅专栏

Common Subsequence

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 44054		Accepted: 17997

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, x _{i_j} = 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

Source

Southeastern Europe 2003

[Submit] [Go Back] [Status] [Discuss]

ACcode：

#pragma warning(disable:4786)//使命名长度不受限制
#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define rds(x) scanf("%s",x)
#define rdc(x) scanf("%c",&x)
#define ll long long int
#define maxn 1005
#define mod 1000000007
#define INF 0x3f3f3f3f //int 最大值
#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)
#define MT(x,i) memset(x,i,sizeof(x))
#define PI  acos(-1.0)
#define E  exp(1)
using namespace std;
int dp[maxn][maxn];
string s1,s2;
int main(){
    while(cin>>s1>>s2){
        int lena=s1.length();
        int lenb=s2.length();
        FOR(i,0,lena-1)dp[i][0]=0;
        FOR(j,0,lenb-1)dp[0][j]=0;
        FOR(i,1,lena)
            FOR(j,1,lenb)
                if(s1[i-1]==s2[j-1])
                    dp[i][j]=dp[i-1][j-1]+1;
                else
                    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
        printf("%d\n",dp[lena][lenb]);
    }
    return 0;
}
/*
abcfbc         abfcab
programming    contest
abcd           mnp
*/