poj 1458 Common Subsequence
2015-08-13 20:11
417 查看
[align=center]Common Subsequence[/align]
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
题意:
输入两个字符串,让你求最长公共子序列(这个子序列可以不连续),所以用LCS算法很容易就能解决。虽然讲的时候有点麻烦,但是代码非常简单,看代码吧!
代码:
思路:
搜索
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 43303 | Accepted: 17580 |
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
题意:
输入两个字符串,让你求最长公共子序列(这个子序列可以不连续),所以用LCS算法很容易就能解决。虽然讲的时候有点麻烦,但是代码非常简单,看代码吧!
代码:
#include <stdio.h> #include <string.h> #define max(a,b) (a>b?a:b) int n; char a[1005],b[1005]; int p[1005][1005]; int main() { int len1,len2; while(scanf("%s%s",a,b)!=EOF) { len1=strlen(a); len2=strlen(b); for(int i=1;i<=len1;i++) for(int j=1;j<=len2;j++) { if(a[i-1]==b[j-1]) { p[i][j]=p[i-1][j-1]+1; } else { p[i][j]=max(p[i-1][j],p[i][j-1]); } } printf("%d\n",p[len1][len2]); } return 0; }
思路:
搜索
相关文章推荐
- LeetCode-Implement Queue using Stacks
- UIControl和它的子类
- android 事件处理机制之requestDisallowInterceptTouchEvent
- The Unique MST--hdoj
- The Unique MST--hdoj
- HDU1711-Number Sequence-KMP算法(模板)
- 代码手写UI,xib和StoryBoard间的博弈
- UITableView 的编辑
- UITextField 详解
- 配置UIAutomator中的ANT环境报不是内部命令与外部命令
- SOAPUI 循环设置
- SOAPUI 属性传递之二
- SOAPUI 数据源设置
- iOS开发UI中懒加载的使用方法
- UITableViewCell左侧会有默认15像素的空白
- SOAPUI 属性设置
- 关于自定义UITableViewCell布局点击Cell消失的问题
- 手写输入法输入 [UIKBBlurredKeyView candidateList]
- 获取UITableView每行中不同的UITextField输入的内容
- MySQL 5.6 中TIMESTAMP with implicit DEFAULT value is deprecated错误