howell

I just follow my heart ! ! !

Common Subsequence(最长公共子序列)

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 58428 Accepted: 24399

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

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


就是求最长公共子序列


代码:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
#define ll lonng long
using namespace std;
const int maxn = 207;

string a, b;
int dp[maxn][maxn];


int main()
{
    while(cin>>a>>b) {
        int lena = a.length(), lenb = b.length();
        memset(dp, 0, sizeof(dp));
        for(int i = 0; i < lena; i++) {
            for(int j = 0; j < lenb; j++) {
                if(a[i] == b[j]) dp[i+1][j+1] = dp[i][j] + 1;
                else {
                    dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
                }
            }
        }
        printf("%d\n", dp[lena][lenb]);
    }
    return 0;
}

阅读更多
版权声明: https://blog.csdn.net/weixin_39792252/article/details/79947738
个人分类: 动态规划 HDU
上一篇最少拦截系统_HDU 1257_(贪心)
下一篇Piggy-Bank HDU - 1114 (完全背包)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭