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): 34866 Accepted Submission(s): 15915

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

【中文题意】问你两个代码的最长的子序列的长度为多少。
【思路分析】直接套模板。
【AC代码】

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char a[1005],b[1005];int dp[1005][1005];int main(){    while(~scanf("%s%s",a+1,b+1))    {        int len1=strlen(a+1);        int len2=strlen(b+1);        memset(dp,0,sizeof(dp));        for(int i=1;i<=len1;i++)        {            for(int j=1;j<=len2;j++)            {                if(a[i]==b[j])                {                    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;}