hdoj1159 (dp 最长公共子序列)
来源:互联网 发布:苗阜相声水平知乎 编辑:程序博客网 时间:2024/06/06 11:46
题目: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.
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 abfcabprogramming contest abcd mnp
Sample Output
420
求最长公共子序列,
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;}
- hdoj1159 (dp 最长公共子序列)
- 最长公共子序列(hdoj1159)
- 最长公共子序列--DP
- DP---最长公共子序列
- 最长公共子序列dp
- DP 最长公共子序列
- DP 最长公共子序列
- 最长公共子序列-DP
- 【DP】最长公共子序列。
- 最长公共子序列 DP
- DP--最长公共子序列
- dp最长公共子序列
- dp 最长公共子序列
- DP最长公共子序列
- 最长公共子序列-dp
- dp--最长公共子序列
- 最长公共子序列<DP>
- 最长公共子序列(DP)
- 大小之差 (2013年11月24日 蓝桥杯校内选拔赛c\c++B组)
- mysql对时间操作的几个小结
- [转]编程面试的10大算法概念汇总(译)
- 网站设计借鉴不等同于抄袭
- 第十一节cocosdx的内存管理机制
- hdoj1159 (dp 最长公共子序列)
- 原创快速哈希算法 FHA1
- 朴素贝叶斯分类算法(Naive Bayesian classification)
- 数据库 左外连接 右外连接 内连接
- 11
- INSERTION-SORT(A)的C++代码
- 回文数字 (2013年11月24日 蓝桥杯校内选拔赛c\c++B组)
- 第十二节cocosdx的屏幕适配的问题
- ubuntu安装使用ffmpeg