HDU 1159 Common Subsequence(最长公共子序列模板题)
来源:互联网 发布:数控车床g73凹圆弧编程 编辑:程序博客网 时间:2024/06/18 11:14
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40985 Accepted Submission(s): 18931
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
代码如下:
#include<cstdio>#include<cstring>#include<iostream>using namespace std;int dp[10005][10005];char str1[10005],str2[10005];int main(){while(~scanf("%s%s",&str1,&str2)){int len1=strlen(str1);int len2=strlen(str2);dp[len1][len2]=0;for(int i=1;i<=len1;i++){for(int j=1;j<=len2;j++){if(i==0 || j==0)dp[i][j]=0;else{if(str1[i-1]==str2[j-1])dp[i][j]=dp[i-1][j-1]+1;elsedp[i][j]=max(dp[i-1][j],dp[i][j-1]);}}}printf("%d\n",dp[len1][len2]);}return 0;}
阅读全文
0 0
- HDU 1159 Common Subsequence(最长公共子序列模板题)
- hdu 1159 Common Subsequence ***poj1458(最长公共子序列)
- HDU 1159:Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence--DP--(最长公共子序列)
- HDU 1159 Common Subsequence(DP最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列问题)
- hdu 1159 Common Subsequence (最长公共子序列)
- HDU-1159-Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)dp
- hdu 1159 Common Subsequence (最长公共子序列 +代码)
- HDU 1159 Common Subsequence (最长公共子序列)
- 【HDU 1159】Common Subsequence (最长公共子序列)
- 【HDU】1159 Common Subsequence(DP、最长公共子序列)
- HDU Common Subsequence 最长公共子序列
- HDU Common Subsequence(最长公共子序列)
- 服务器操作系统该选 Debian/Ubuntu 还是 CentOS?
- 2017年8月17日训练日记
- 文章标题
- 使用FreeMarker生成Word文档中的表格
- junit的使用
- HDU 1159 Common Subsequence(最长公共子序列模板题)
- Nginx反向代理和负载均衡部署指南
- Java web学习笔记之DAO设计模式
- 洛谷P2125 图书馆书架上的书
- Redis简介和简单应用
- HTML笔记(四)bootstrap之form表单
- Python爬虫爬取智联招聘职位信息
- 文章标题
- ajax标准写法