hdoj1159 (dp　最长公共子序列)

最新推荐文章于 2019-06-29 14:24:13 发布

原创最新推荐文章于 2019-06-29 14:24:13 发布 · 642 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#dp #最长公共子序列

ACM_DP 专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一种寻找两个字符串中最长公共子序列的算法实现，通过动态规划的方法逐步构建解决方案，并给出了具体的代码示例。

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

Common Subsequence

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

求最长公共子序列，

if(s1[i]==s2[j])dp[i][j]=dp[i-1][j-1]+1;
else
    dp[i][j]=max(dp[i][j-1],dp[i-1][j]);

这个题目有个地方没想清楚，自己的代码第一次把dp[][]初始化为0以后，之后就应该不必再初始化的，

但提交的时候不初始化就报错，找了很久没找到原因

#include<stdio.h>
#include<string.h>
#define N 500
 int dp[N][N]={0};
int max(int x,int y)
{
    if(x>y)return x;
    return y;
}
int main()
{
    int i,j,k;
    char s1[N],s2[N];
    while(scanf("%s%s",s1+1,s2+1)!=EOF)
    {
       memset(dp,0,sizeof(dp));
        for(i=1;s1[i];i++)
        {
            for(j=1;s2[j];j++)
            {
                if(s1[i]==s2[j])dp[i][j]=dp[i-1][j-1]+1;
                else
                    dp[i][j]=max(dp[i][j-1],dp[i-1][j]);

            }
        }
        printf("%d\n",dp[i-1][j-1]);
    }
    return 0;
}