POJ 1458 Common Subsequence

原创 2016年08月29日 16:57:31

Question:
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 ij = 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
题目大意:给出两个字符串,求其最大公共子序列的长度。
解题思路:就是一道裸的求最长公共子序列的题。
(http://acm.hust.edu.cn/vjudge/contest/125402#problem/E)

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
LL dp[1005][1005];  
char s[1005],z[1005];
int main()
{
    while(~scanf("%s%s",s,z))
    {
        memset(dp,0,sizeof(dp));
        int len1=strlen(s);
        int len2=strlen(z);  //以前容易把这一步放进循环中,造成时间复杂度很高
        for(int i=1;i<=len1;i++)
        {
            for(int j=1;j<=len2;j++)
            {
                if(s[i-1]==z[j-1])
                    dp[i][j]=dp[i-1][j-1]+1;   //dp[i][j]表示i长度的字符串与j长度的字符串的相同字母
                else
                    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
        }
        cout<<dp[len1][len2]<<endl;
    }
}

体会:这是一道裸的求最大公共子序列的题,只需记下模板,方便以后套用

版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ 1458 && HDU 1159 Common Subsequence (最長公共子序列)dp

鏈接: http://poj.org/problem?id=1458 Description: A subsequence of a given sequence is the given se...

poj 1458 Common Subsequence

Common Subsequence Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3871...

Poj 1458 Common Subsequence(LCS)

一、Description A subsequence of a given sequence is the given sequence with some elements (possible ...

POJ1458 Common Subsequence

Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 47372 Accepted: 19460 Description A subse...

POJ1458 Common Subsequence 动态规划

提意: 各处两个字符序列{an}和{bn},求它们的最长公共子序列的长度 设f[i][j]表示{an}的前i个字符构成的序列与{bm}的前j个字符构成的序列的最长公共子序列的 长度,{an}与{...

POJ 1458 Common Subsequence(最长公共子序列LCS)

POJ 1458 Common Subsequence(最长公共子序列LCS) http://poj.org/problem?id=1458 题意: 给你两个字符串, 要你求出两个字符串...

POJ -- 1458 Common Subsequence

Common Subsequence Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%lld & %llu De...
  • ah_yeah
  • ah_yeah
  • 2016年08月11日 21:39
  • 84

DP-POJ-1458-Common Subsequence

Common Subsequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 44093 Ac...

poj_1458 Common Subsequence

DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none...
  • joan333
  • joan333
  • 2011年07月28日 13:49
  • 70

POJ 1458 Common Subsequence

POJ 1458 Common Subsequence   算法解析:这是一道标准的LCS问题(Longest Common Subsequence),标准解法则是动态规划: 以两个序列 X、Y...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1458 Common Subsequence
举报原因:
原因补充:

(最多只允许输入30个字)