HDU 1159 Common Subsequence (dp)
来源:互联网 发布:web前端开发必备软件 编辑:程序博客网 时间:2024/06/05 06:10
Common Subsequence
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 2 Accepted Submission(s) : 2
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
Source
Southeastern Europe 2003
求相同的最长子序列
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int dp[1010][1010];char s1[1010],s2[1010];int main(){int i,j,k,l,m,n,len1,len2;while(scanf("%s%s",s1,s2)!=EOF){len1=strlen(s1);len2=strlen(s2);for(i=1;i<=len1;i++){for(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][j-1],dp[i-1][j]); }}printf("%d\n",dp[len1][len2]);}return 0;}
1 0
- hdu 1159 Common Subsequence #DP
- hdu 1159 Common Subsequence (dp)
- HDU--1159 -- Common Subsequence [DP]
- hdu 1159 Common Subsequence(dp)
- HDU 1159 Common Subsequence (dp)
- Common Subsequence(dp)HDU 1159
- Common Subsequence HDU dp
- HDU 1159 Common Subsequence(还是DP)
- hdu 题目1159 Common Subsequence(DP)
- HDU 1159 Common Subsequence(DP,LCS)
- hdu 1159 Common Subsequence(LCS,dp)
- HDU 1159 Common Subsequence(dp LCS)
- HDU 1159 Common Subsequence (备忘录DP)
- hdu 1159 Common Subsequence(dp)
- hdu 1159 Common Subsequence (dp)
- Hdu oj 1159 Common Subsequence(dp)
- HDU 1159 Common Subsequence LCS+DP .
- HDU 1159 Common Subsequence(基础dp)
- 如何安装GoAgent
- 如何进行培养客户的成交量
- LeetCode之旅(16)-Climbing Stairs
- 高并发、分布式交易场景下唯一ID生成方法
- tomcat的性能优化
- HDU 1159 Common Subsequence (dp)
- mysql 建表 插入数据 添加删除主外键
- A股涉及无人驾驶概念的上市公司
- 服务器编程之sessionID 和 账户id
- file-max决于内存约为64个/M
- coreboot学习9:ramstage阶段之设备初始化流程
- LA3693
- 旧手机也可以变宝贝,95%的人不知道!
- [leetcode]151. Reverse Words in a String