HDU 1159 Common Subsequence
来源:互联网 发布:扒谱子软件 编辑:程序博客网 时间:2024/06/06 15:27
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40922 Accepted Submission(s): 18891
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
一个lcs问题,也挺水的
#include<iostream>#include<cstring>#include<cstdio>using namespace std;int dp[666][666];int main(){char str[666];char str2[666];while(~scanf("%s %s",str,str2)){memset(dp,0,sizeof(dp));int len=strlen(str);int len2=strlen(str2);for(int i=1;i<=len;i++){for(int j=1;j<=len2;j++){if(str[i-1]==str2[j-1]) dp[i][j]=dp[i-1][j-1]+1;else dp[i][j]=max(dp[i][j-1],dp[i-1][j]);}}cout<<dp[len][len2]<<endl;}}
阅读全文
0 0
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- Common Subsequence hdu 1159
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- VS2015+Anaconda4.4.0(Python3.6)+Theano+CUDA8.0+cuDNN5.1环境配置
- 关于java版本
- C++ explicit关键字详解
- Java反射机制
- TensorFlow-tf.clip_by_global_norm函数原理
- HDU 1159 Common Subsequence
- 切图异常: Cannot run program "gm": error=2, No such file or directory 处理
- C++ 封装 随笔
- 一键重装系统,装机员一键重装最新版
- JavaScript权威指南读书笔记—— 模块
- Leetcode 刷题 Day4 136.SingleNumber
- composer 安装laravel指定版本
- List接口的ArrayList的使用
- [bzoj2251][后缀数组][2010Beijing Wc]外星联络