HDU-1159 Common Subsequence(最长公共子序列)
来源:互联网 发布:形容数据整齐的词语 编辑:程序博客网 时间:2024/06/03 19:31
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38122 Accepted Submission(s): 17479
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
#include <iostream>#include <string>#include <string.h>#include <algorithm>using namespace std;const int maxn = 1e+3;string a,b;int dp[maxn][maxn];int main(){ while(cin>>a>>b){ memset(dp,0,sizeof(dp)); int lena=a.length(); int lenb=b.length(); for(int i=1;i<=lena;i++){ for(int j=1;j<=lenb;j++){ if(a[i-1]==b[j-1]){ dp[i][j]=dp[i-1][j-1]+1; } else{ dp[i][j]=max(dp[i-1][j],dp[i][j-1]); } } } cout<<dp[lena][lenb]<<endl; } return 0;}
0 0
- HDU Common Subsequence 最长公共子序列
- HDU Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence ***poj1458(最长公共子序列)
- hdu 1159 Common Subsequence 最长公共子序列
- hdu 1159 Common Subsequence(DP最长公共子序列)
- HDU 1159 Common Subsequence 最长公共子序列
- HDU 1159 Common Subsequence--最长公共子序列
- hdu 1159 Common Subsequence (最长公共子序列)
- Common Subsequence 最长公共子序列 hdu 1159
- hdu 1159 Common Subsequence(LCS最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence(动态规划:最长公共子序列)
- HDU 1159 Common Subsequence (动规+最长公共子序列)
- HDU 1159:Common Subsequence(最长公共子序列)
- 最长公共子序列DP Common Subsequence HDU 1159
- hdu 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- Action/Service/DAO简介
- 训练样本制作--Annotating Object Instances with a Polygon-RNN
- Linux命令
- sim开机APDU命令流程
- 无痛学会各种 2 的 Vue2+Vuex2+Webpack2 前后端同构渲染
- HDU-1159 Common Subsequence(最长公共子序列)
- Ubuntu16.04设置静态IP
- fan out flow
- Linux命令行与shell脚本(18)--shell连接mysql
- Spring Boot 核心-外部配置
- CUDA deviceQuery参数详解
- C++第五次作业报告
- 解决手机端中文输入法中keyup不灵便的方法
- 数据预处理-OneHot编码