杭电1159-Common Subsequence
来源:互联网 发布:形容网络发达的句子 编辑:程序博客网 时间:2024/05/22 12:59
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17428 Accepted Submission(s): 7316
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一道求最长公共子序列的题目,刚开始不知道是用DP求后来看了别人的代码才知道这是用一道简单的DP题目,我当时顿时无语了AC代码:#include<iostream>//最长公共子序列#include<cstdio>#include<cstring>#include<string>#include<algorithm>const int MAX=1001;char x[MAX];char y[MAX];int DP[MAX][MAX];using namespace std;int Max(int x,int y){ return x>y?x:y;}int main(){ int n,m,i,j; while(cin>>x>>y) { n=strlen(x); m=strlen(y); memset(DP,0,sizeof(DP)); for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { if(x[i-1]==y[j-1]) DP[i][j]=DP[i-1][j-1]+1;//如果找到了就在前一步加+1 else DP[i][j]=Max(DP[i-1][j],DP[i][j-1]);//没有的就看哪个序列最长 } } cout<<DP[n][m]<<endl; } return 0;}
- 杭电1159-Common Subsequence
- 杭电1159Common Subsequence
- HDOJ 1159 Common Subsequence 杭电 ACM
- 杭电OJ 1159 :Common Subsequence
- 杭电 HDU ACM 1159 Common Subsequence
- 杭电1159—Common Subsequence题解
- 杭电-1159Common Subsequence(LCS)
- 【杭电oj1159】Common Subsequence
- 动态规划—杭电1159 Common Subsequence
- 杭电1159——Common Subsequence
- 杭电1159(Common Subsequence)LCS和dp
- 杭电-1159 Common Subsequence(最长公共子序列)
- 杭电acm 1159Common Subsequence(字符串处理+dp)
- 杭电1423(Greatest Common Increasing Subsequence)
- Common Subsequence 杭电HDU1159 【动态规划LCS】
- hdu 1159 Common Subsequence
- HDOJ 1159:Common Subsequence
- hdoj 1159 Common Subsequence
- C++、GDAL创建shapefile,并向矢量文件中添加网格
- spoj 147
- 低成本MOS管下管驱动电路原理分析
- Linux上iptables防火墙的基本应用教程
- 飘逸的python - 多条件排序及itemgetter的应用
- 杭电1159-Common Subsequence
- C#学习笔记02:程序结构
- kinetis晶体谐振器到底要不要加电容和电阻
- ::Coinitialize and ::CoUninitialize
- shell笔记(三)——其他循环结构
- poj 1679 Prim判断次短路
- vs2010添加TSTCON( ActiveX Control Test Container )工具
- MOS管构成的简易双向电平转换电路
- Eclipse的JNI环境搭建