poj 1458 Common Subsequence【LCS】
2015-08-10 10:10
609 查看
Common Subsequence
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
Sample Output
Source
Southeastern Europe 2003
分析:求最长公共子序列的模板题。
代码:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 43132 | Accepted: 17472 |
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 abfcab programming contest abcd mnp
Sample Output
4 2 0
Source
Southeastern Europe 2003
分析:求最长公共子序列的模板题。
代码:
#include<cstdio> #include<cstring> #include<algorithm> #define max(a,b) (a>b?a:b) using namespace std; char s1[1010],s2[1010]; int dp[1010][1010]; int main() { while(scanf("%s%s",s1,s2)!=EOF) { memset(dp,0,sizeof(dp)); int l1,l2; l1=strlen(s1); l2=strlen(s2); int i,j; for(i=1;i<=l1;i++) { for(j=1;j<=l2;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[l1][l2]); } }
相关文章推荐
- Buildroot用户指南
- 【代码优化】当许多构造函数的参数,请考虑使用builder模式
- 【Android UI】ViewFlipper实现广告轮播图
- poj 1458 Common Subsequence【LCS】
- Snail—UI学习之时间选择器UIDatePicker
- B. Equidistant String
- 在RESTful中,遇到400 Bad Request
- UIPickerView的使用
- Hibernate SQLQuery 原生SQL 查询及返回结果集处理
- UITableView省市区数组
- UITableView
- UITableView
- UI08_TableView界面传值
- PHP 用QueryList抓取网页内容
- UI08_TableView
- POJ 2533 Longest Ordered Subsequence(DP 最长上升子序列)
- iOS UI_电话本
- iOS UI_相册
- UI连载五--常用UI控件—Label、Button、UITextField、UIImageView、UISlider、UISwitch、UIActivityIndicatorView等
- iOS UI08_tableView省市区字典数组