HDU 1159 Common Subsequence【LCS(dp)】
来源:互联网 发布:淘宝买家如何开店 编辑:程序博客网 时间:2024/05/22 06:41
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38245 Accepted Submission(s): 17537
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
Recommend
Ignatius
#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<cmath>#include<map>#include<vector>#include<queue>#include<stack>#include<algorithm>using namespace std;#define ll long long#define ms(a,b) memset(a,b,sizeof(a))const int M=1e3+10;int i,j,k,n,m;char s1[M],s2[M];int dp[M][M];int main(){ int T=1; while(~scanf("%s %s",s1,s2)){ int l1=strlen(s1),l2=strlen(s2); ms(dp,0); for(int i=0;i<l1;i++) for(int j=0;j<l2;j++){ if(s1[i]==s2[j]) dp[i+1][j+1]=dp[i][j]+1; else dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]); } printf("%d\n",dp[l1][l2]); } return 0;}
0 0
- HDU 1159 Common Subsequence(dp LCS)
- HDU 1159 Common Subsequence【LCS(dp)】
- HDU 1159 Common Subsequence(DP,LCS)
- hdu 1159 Common Subsequence(LCS,dp)
- HDU 1159 Common Subsequence LCS+DP .
- hdu 1159 Common Subsequence (dp求LCS)
- 【HDU 1159】 Common Subsequence(dp —lcs模板题)
- HDU 1159 Common Subsequence(LCS)
- HDU - 1159 Common Subsequence (简单LCS)
- 【HDU】-1159-Common Subsequence(LCS,模板)
- HDU 1159 Common Subsequence(LCS)
- 【HDU】1159 - Common Subsequence(LCS)
- hdu 1159 Common Subsequence (LCS)
- 【hdu 1159】Common Subsequence(LCS模板)
- Common Subsequence (lcs)【HDU】-1159
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence (LCS)
- HDU 1159 Common Subsequence(LCS)
- Linux学习笔记(五)-安全管理以及开发基础技术
- Children of the Candy Corn POJ 3083(bfs)
- 央视315曝光活体识别的漏洞,是不是再次掀起一股智能AI浪潮?
- STL中list的使用
- Codeforces798D Mike and distribution
- HDU 1159 Common Subsequence【LCS(dp)】
- restTemplate公用魔板使用及中文乱码问题
- 中序遍历树(不一定是二叉树)
- SMTP邮件传输协议发送邮件和附件
- POJ 2431 Expedition(贪心+优先队列)
- linux基础3.12shell脚本2
- NIO中通道(Channel)
- 【Summary】——>Web组.Week4
- Struts2框架的基本使用(三)