hdu-题目1159：Common Subsequence

http://acm.hdu.edu.cn/showproblem.php?pid=1159

Common Subsequence

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

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

 

Source

Southeastern Europe 2003

 

Recommend

Ignatius

 

动态规划中的最长公共子序列。用dp[i][j]保存第一个字符串前i个字符和第二个字符串前j个字符的公共子序列长度。

如果str1[i]==str2[j]，dp[i][j]=dp[i-1][j-1]。

如果str1[i]!=str2[j]，dp[i][j]=max(dp[i-1][j],dp[i][j-1])

上述即是动态规划的状态转移公式。

 

#include <stdio.h>
#include <string.h>

using namespace std;

int dp[1001][1001];

char str1[1001], str2[1001];

int max(int a, int b)
{
    if(a>b)
        return a;
    else
        return b;
}

int main()
{
    while(scanf("%s %s", str1, str2)!=EOF)
    {

        int len1=strlen(str1);
        int len2=strlen(str2);


        for(int i=0; i<=len1; i++) dp[i][0]=0;
        for(int j=0; j<=len2; j++) dp[0][j]=0;

        for(int i=1; i<=len1; i++)
            for(int j=1; j<=len2; j++)
        {
            if(str1[i-1]!=str2[j-1])
            {
                dp[i][j]=max(dp[i-1][j], dp[i][j-1]);

            }

            else
            {
                dp[i][j]=dp[i-1][j-1]+1;
            }
        }

    printf("%d
",dp[len1][len2]);
    }

    return 0;
}