poj 1458 Common Subsequence(LCS)
来源:互联网 发布:日剧的价值观知乎 编辑:程序博客网 时间:2024/06/05 17:10
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 48071 Accepted: 19813
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.
Input
The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.
Output
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;int dp[1010][1010];int main(){ char s1[1010]; char s2[1010]; while(~scanf("%s",s1)) { scanf("%s",s2); memset(dp,0,sizeof(dp)); int len1 = strlen(s1); int len2 = strlen(s2); for(int i = 1 ; i <= len1 ; i++) for(int j = 1 ; j <= len2 ; j++) { if(s1[i-1] == s2[j-1]) dp[i][j] = dp[i-1][j-1] + 1; else dp[i][j] = max(dp[i-1][j],dp[i][j-1]); } printf("%d\n",dp[len1][len2]); } return 0;}
0 0
- POJ 1458 Common Subsequence (DP,LCS)
- poj 1458 Common Subsequence(LCS)
- poj 1458 Common Subsequence (DP:LCS)
- poj - 1458 - Common Subsequence(LCS)
- poj 1458 Common Subsequence(lcs模板)
- POJ:1458 Common Subsequence(LCS)
- poj 1458 Common Subsequence(LCS)
- poj 1458 Common Subsequence(lcs)
- POJ 1458 Common Subsequence(LCS)
- POJ 1458 Common Subsequence(LCS)
- Poj 1458 Common Subsequence(LCS)
- POJ 1458 Common Subsequence(lcs)
- POJ 1458--Common Subsequence【LCS】
- POJ - 1458 - Common Subsequence (LCS)
- poj 1458 Common Subsequence【LCS】
- POJ 1458 Common Subsequence(LCS)
- poj-1458-Common Subsequence(LCS)
- POJ 1458Common Subsequence(LCS)
- 【Mybatis】利用mybatis-paginator实现分页
- Protocol Buffer使用简介
- BZOJ4580: [Usaco2016 Open]248
- C++操作符重载
- Python sys模块(进阶篇)
- poj 1458 Common Subsequence(LCS)
- 好的框架SSH倡导的好的Java EE软件架构纪实9条
- static和构造函数运行顺序及次数区别
- CAN总线开发实例
- 线程池ThreadPoolExecutor的使用方法
- 常用汇编指令
- Mybatis 与 JDBC 比较
- Batch interval, window length and slide duration on Spark Streaming
- golang的服务控制实践