hdu 1159 Common Subsequence(LCS)

Common Subsequence

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

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

求两个字符串的最长公共子序列，即LCS。经典的DP
 DP方程：

dp[i][j]=dp[i-1][j-1]+1   （s1[i-1]==s2[j-1]）
dp[i][j]=max(dp[i][j-1],dp[j][i-1])  (s1[i-1]!=s2[j-1])

dp[len1][len2]即为最终的匹配长度。


   
   
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s1[1024],s2[1024];
int dp[1024][1024];
int main()
{
    //freopen("in.txt","r",stdin);
    while(scanf("%s %s",s1,s2)!=EOF)
    {
        memset(dp,0,sizeof(dp));
        int len1=strlen(s1);
        int len2=strlen(s2);
        for(int i=1;i<=len1;i++)
        {
            for(int 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;
}