poj-------Common Subsequence(poj 1458)
Common Subsequence
Time Limit: 1000MS |
Memory Limit: 10000K |
|
---|---|---|
Total Submissions: 34477 |
Accepted: 13631 |
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 abfcab
programming contest
abcd mnp
Sample Output
4
2
0
Source
题意:
求两个字符串的最长公共子序列(lcs)的长度。
思路:
金典问题,动态转移方程如下:
1 if(i==0||j==0)
2 dp[i][j]=0;
3 else if(x[i]==y[i])
4 dp[i][j]=dp[i-1][j-1]+1;
5 else
6 dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
代码如下:
1 #include<iostream>
2 #include<string>
3 #include<cmath>
4 using namespace std;
5 const int MAX=500;
6 int dp[MAX][MAX]={0};
7 int max(int a,int b)
8 {
9 return a>b?a:b;
10 }
11 int main(int *argv,int *argc[])
12 {
13 int len1,len2,i,j;
14 string str1,str2; //有时在时间允许范围内,用cin读字符串比较方便
15 while(cin>>str1>>str2)
16 {
17 len1=str1.length();
18 len2=str2.length();
19 for(i=1;i<=len1;i++)
20 {
21 for(j=1;j<=len2;j++)
22 //转移方程
23 {
24 if(str1[i-1]==str2[j-1])
25 dp[i][j]=dp[i-1][j-1]+1;
26 else
27 dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
28 }
29 }
30 cout<<dp[len1][len2]<<endl;
31 }
32 return 0;
33 }
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法
- MySQL information_schema详解 GLOBAL_VARIABLES和SESSION_VARIABLES
- 我爬取了知乎上大学相关话题中的热门高赞问答,其中是否有你大学生活的影子呢?
- MySQL information_schema详解 KEY_COLUMN_USAGE
- Python 实现黑客帝国代码雨效果
- MySQL information_schema详解 ndb_transid_mysql_connection_map
- MySQL information_schema详解 OPTIMIZER_TRACE
- 用 Python 画一个奸笑(滑稽)表情
- Python 进阶(十):网络编程
- Python 数据分析(二):Matplotlib 绘图
- 用 Python 制作一个艺术签名小工具,给自己设计一个优雅的签名
- 你认可《后浪》吗
- Python 数据分析(三):初识 Pandas
- MySQL information_schema详解 PARAMETERS
- Python 数据分析(四):Pandas 进阶
- 用 Python 写一个颜值测试小工具