【HDU】-1159-Common Subsequence(LCS,模板)
来源:互联网 发布:书生阅读器windows版 编辑:程序博客网 时间:2024/06/08 05:34
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34177 Accepted Submission(s): 15581
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<algorithm>using namespace std;#define INF 0x3f3f3f3f#define CLR(a,b) memset(a,b,sizeof(a))#define M 1010char s1[M];char s2[M];int dp[M][M];int main(){int i,j;while(~scanf("%s%s",s1,s2)){int l1=strlen(s1);int l2=strlen(s2);for(i=0;i<=l1;i++)dp[i][0]=0;for(i=0;i<=l2;i++)dp[0][i]=0;for(i=1;i<=l1;i++){for(j=1;j<=l2;j++){if(s1[i-1]==s2[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[l1][l2]);} return 0;}
0 0
- 【HDU】-1159-Common Subsequence(LCS,模板)
- 【hdu 1159】Common Subsequence(LCS模板)
- HDU 1159 Common Subsequence(LCS 模板题)
- 【HDU 1159】 Common Subsequence(dp —lcs模板题)
- HDU 1159 Common Subsequence(LCS)
- HDU - 1159 Common Subsequence (简单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(dp)】
- Common Subsequence (lcs)【HDU】-1159
- 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)
- 解释器模式
- 数据结构实验之二叉树六:哈夫曼编码
- java 重写 与 重载 区别
- 巧夺天工的kfifo
- 【NOIP2012模拟11.7】秘密文件
- 【HDU】-1159-Common Subsequence(LCS,模板)
- 用sql语句创建表
- 【OVS2.5.0源码分析】normal action精确流表生成和刷新过程分析
- Leetcode no. 67
- 软件开发实践中的入队列和出队列操作的C代码示例
- Python模块
- c++ string类实现
- MySQL集群系列1:2台机器搭建双主集群
- Android Fragment的子fragment之间切换保存状态遇到的坑