HDU 1159 最长公共子串
来源:互联网 发布:淘宝office激活原理 编辑:程序博客网 时间:2024/06/09 17:32
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30156 Accepted Submission(s): 13591
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<bits/stdc++.h>using namespace std;char s[10000],s1[10000];int dp[1020][2002];int main(){ while(~scanf("%s%s",s,s1)) { int len=strlen(s); int len1=strlen(s1); memset(dp,0,sizeof(dp)); int Max=-1; for(int i=1;i<=len;i++) { for(int j=1;j<=len1;j++) { if(s[i-1]==s1[j-1]) //相等时 { dp[i][j]=dp[i-1][j-1]+1; } else dp[i][j]=max(dp[i][j-1],dp[i-1][j]); //递推最大值 //Max=max(Max,dp[i][j]); } } printf("%d\n",dp[len][len1]); } return 0;}
0 0
- HDU 1159 最长公共子串
- hdu 1159/poj1458 Common Subsequence 最长公共子串
- HDU-1159 Common Subsequence (线性dp 最长公共子串)
- hdu 1159 (最长公共子序列)
- hdu 1159 最长公共子序列
- HDU 1159 最长公共子序列
- HDU 1159 最长公共子序列
- hdu 1159 最长公共子序列
- HDU 1159 最长公共子序列
- HDU-1159(DP_最长公共子序列)
- hdu 1159 最长公共子序列
- HDU 1159 最长公共子序列
- hdu 1159 最长公共子序列
- hdu 1159 最长公共子序列
- HDU 1159(最长公共子序列)
- hdu 1159 最长公共子序列问题
- hdu 1159(最长公共子序列)
- hdu 1159(最长公共子序列)
- mongodb概述 二以及和 mysql的比较
- 山东大学使用QLSC_STU避免掉线的方法java版实现
- Head First HTML&CSS 笔记(2)-定位与布局
- 彻底弄懂最短路径问题
- Ajax技术POST交互实现二级联动菜单
- HDU 1159 最长公共子串
- 图片放大缩小
- 自定义SlideMenu侧滑菜单
- IO流--粘贴复制
- git revert 和 git reset
- C++拷贝构造函数和移动构造函数
- 用IDEA启动非maven管理的web项目
- DHT11数字温湿度传感器
- 面试相关问题---待解决