1159最长公共子序列

Common Subsequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32693    Accepted Submission(s): 14786


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.
 

 

Sample Input
abcfbc abfcab
programming contest
abcd mnp
 

 

Sample Output
4
2
0
 

 


 
题意:求两个字符串的最长公共子序列的长度
 
题解: dp[i][j] 表示a串前i个字符与b串前j个字符 最长公共子序列的长度 N(n*m)
         当a[i]==a[j]时  dp[i][j]=dp[i-1][j-1]+1;
        否则 dp[i][j]=max(dp[i-1][j],dp[i][j-1])//区分于最长公共子串
 
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
char a[1005],b[1005];
int dp[1005][1005];
int main()
{
    while(cin>>a>>b)
{
    int len1=strlen(a);
    int len2=strlen(b);
    memset(dp,0,sizeof(dp));
    for(int i=1;i<=len1;i++)
    for(int j=1;j<=len2;j++)
    {
        if(a[i-1]==b[j-1])
        dp[i][j]=dp[i-1][j-1]+1;
        else
        dp[i][j]=max(dp[i-1][j],dp[i][j-1]); //传递最大值
    }
    cout<<dp[len1][len2]<<endl;
}
    return 0;
}
阅读更多
个人分类: dp 模板
上一篇2018山东大学acm校赛B
下一篇ACM山东大学2018 校赛i
想对作者说点什么? 我来说一句

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

不良信息举报

1159最长公共子序列

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭