UVA10405 Longest Common Subsequence

A - Longest Common Subsequence

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  UVA 10405

Description

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

4
3
26
14

---

Problem Setter: Piotr Rudnicki

解题思路：

这题是经典的dp，

                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]);
                }

上面是本题dp的核心，这题比较坑的地方是输入的字符串可能包含空格。

#include <stdio.h>
#include <string.h>
#define max(a, b) (a > b ? a : b)
#define MAXN 1005

int dp[MAXN][MAXN], i, j;
char s1[MAXN], s2[MAXN];

int main()
{
    while(gets(s1) && gets(s2))
    {
        memset(dp, 0, sizeof(dp));
        int len1 = strlen(s1);
        int len2 = strlen(s2);
        for (i = 1; i <= len1; i ++)
        {
            for (j = 1; j <= len2; j ++)
            {
                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[len1][len2]);
    }
    return 0;
}