POJ:1458 Common Subsequence(LCS)
来源:互联网 发布:淘宝售后率高 编辑:程序博客网 时间:2024/06/05 18:44
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 47946 Accepted: 19749
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
Source
Southeastern Europe 2003
题目大意:求最长公共子序列的长度。
解题思路:LCS裸题。
代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char s1[1010],s2[1010];int dp[1010][1010];int main(){while(scanf("%s %s",s1,s2)!=EOF){int len1=strlen(s1);int len2=strlen(s2);memset(dp,0,sizeof(dp));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)
- 素数判断(朴素、高效)
- SQLi Labs Lesson8
- java设计模式_UML类图(下)
- MJExtension使用指导
- ArcGIS无法移动要素,坐标或测量值超出范围的问题
- POJ:1458 Common Subsequence(LCS)
- hdoj 1503 Advanced Fruits (LCS 变形合并)
- hdu3518
- FPGA入门第一步
- Idea 解决回退与上一视图冲突
- Java 异常处理
- 模糊匹配及Solr关键词自动提示应用
- 【转载】Python正则表达式详解
- HashMap和Hashtable的区别