3002
来源:互联网 发布:看美股用什么软件 编辑:程序博客网 时间:2024/05/29 18:36
3002
Problem 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. <br>The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. 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. <br>
Sample Input
abcfbc abfcabprogramming contest abcd mnp
Sample Output
420
题意:
输入两个字符串,求他们的最长公共子序列的长度
思路:
第一反应是用搜索做,但后来想了一下,既然是在学动态规划,那肯定是用动态规划更好了。
首先用两个数组存放数据元素,然后对这两个数组进行比较。
如果序列对应的字符相同,如果序列对用的字符不同,则数组往后滚动。
AC代码:
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
char s1[1000],s2[1000];
int dp[1000][1000];
int len1,len2;
void LCS()
{
int i,j;
memset(dp,0,sizeof(dp));
for(i = 1; i<=len1; i++)
{
for(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]);
}
}
}
int main()
{
while(~scanf("%s%s",s1,s2))
{#include <string.h>
#include <algorithm>
using namespace std;
char s1[1000],s2[1000];
int dp[1000][1000];
int len1,len2;
void LCS()
{
int i,j;
memset(dp,0,sizeof(dp));
for(i = 1; i<=len1; i++)
{
for(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]);
}
}
}
int main()
{
while(~scanf("%s%s",s1,s2))
len1 = strlen(s1);
len2 = strlen(s2);
LCS();
printf("%d\n",dp[len1][len2]);
}
return 0;
}
0 0
- 3002
- Test 3002
- SDUT 3002 素数间隙
- codevs 3002石子归并
- POJ 3002 Jackpot 可能会
- 【3002】删去K个数字
- 最小割集 hdu 3002 ( 模板)
- [数论]POJ 3002 Jackpot 欧几里得算法
- hdu 3002 全局最小割模板题
- 交大OJ 3002 去重归并排序
- hdoj 3002 King of Destruction (最小割边集+Stoer-Wagner算法)
- SDUT 3002-素数间隙(素数筛+暴力)
- 【hadoop】 3002-mapreduce程序统计单词个数示例
- YTU 3002: 出栈顺序(栈和队列)
- 宏基电源管理软件 v5.0.0.3002官方版
- Codevs 3002 石子归并 3(DP四边形不等式优化)
- codevs 3002 石子归并3 (四边形不等式优化dp)
- HDU 3002 King of Destruction(SW求最小割的值)
- yii2搭建完美后台并实现rbac权限控制案例(1)
- HashMap深度解析(一)
- Android 数据存储-内部存储和外部存储
- Huffman编码
- go 协程使用陷阱
- 3002
- window.location.href=document.URL解决window.location.reload()的缺陷
- 开始写博客喽
- ListView中Item失去焦点
- 【Vue】 -(4) 数据绑定语法
- 多线程中局部静态变量初始化的陷阱
- OD重载F2断点消失,无法保存的解决方案
- 深度解读微信提现收费背后的真实意图
- Selenium2 Python 自动化测试实战学习笔记(九)