UVa 10405 - Longest Common Subsequence 最长公共子序列模板

最新推荐文章于 2020-01-27 10:07:07 发布

cyendra

最新推荐文章于 2020-01-27 10:07:07 发布

阅读量942

点赞数

分类专栏： DP 解题报告文章标签：动态规划题解 dp

本文链接：https://blog.csdn.net/cyendra/article/details/8835359

版权

解题报告同时被 2 个专栏收录

260 篇文章

订阅专栏

89 篇文章

订阅专栏

本文介绍了一个经典的计算机科学问题——最长公共子序列问题，并提供了一段C++代码实现。该问题涉及两个字符串作为输入，输出它们之间的最长公共子序列的长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem C: Longest Common Subsequence

Sequence 1:

Sequence 2:

Given two sequences of characters, print the length of the longest common subsequence of both sequences. For example, the longest common subsequence of the following two sequences:

abcdgh
aedfhr

is adh of length 3.

Input consists of pairs of lines. The first line of a pair contains the first string and the second line contains the second string. Each string is on a separate line and consists of at most 1,000 characters

For each subsequent pair of input lines, output a line containing one integer number which satisfies the criteria stated above.

Sample input

a1b2c3d4e
zz1yy2xx3ww4vv
abcdgh
aedfhr
abcdefghijklmnopqrstuvwxyz
a0b0c0d0e0f0g0h0i0j0k0l0m0n0o0p0q0r0s0t0u0v0w0x0y0z0
abcdefghijklmnzyxwvutsrqpo
opqrstuvwxyzabcdefghijklmn

Output for the sample input

-----------------------------------------------------------------

要用gets才给过，但是为什捏。。。

-----------------------------------------------------------------

#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

char s1[1111];
char s2[1111];
int f[1111][1111];

int main()
{
    while (gets(s1+1))
    {
        memset(f,0,sizeof(f));
        gets(s2+1);
        int len1=strlen(s1+1);
        int len2=strlen(s2+1);
        for (int i=1;i<=len1;i++)
            for (int j=1;j<=len2;j++)
                f[i][j]=max( f[i-1][j-1]+(s1[i]==s2[j]), max( f[i-1][j], f[i][j-1] ) );
        printf("%d\n",f[len1][len2]);
    }
    return 0;
}