poj1458 裸题
来源:互联网 发布:java 初始化常量 编辑:程序博客网 时间:2024/06/06 00:35
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 50402 Accepted: 20782
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
思路:LCS裸题,初步理解打个模板奖励一下自己;
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;char a[10010],b[10010];int dp[1010][1010];int main(){while(~scanf("%s %s",a,b)){int len1=strlen(a);int len2=strlen(b);memset(dp,0,sizeof(dp));for(int i=0;i<len1;i++){for(int j=0;j<len2;j++){if(a[i]==b[j])//理解难点;dp[i+1][j+1]=dp[i][j]+1;else dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);}}printf("%d\n",dp[len1][len2]);}return 0;}
1 0
- poj1458 裸题
- poj1458
- POJ1458
- poj1458
- poj1458
- poj1458
- poj1458
- poj1458
- poj1458
- poj1458
- poj1458
- POj1458
- POJ1458
- poj1458
- poj1458
- poj1458
- POJ1458 LCS
- poj1458 dp
- hduoj 5443 The Water Problem【线段树】
- Objetcs类解析
- 仅有wifi的情况下使用Raspberry pi
- 多文档 添加菜单栏 工具栏 删除ribbon
- Android基础——控件的混合生命周期
- poj1458 裸题
- 德才论 (25)
- 23.二叉搜索树的后序遍历序列
- Asp.Net MVC学习总结(三)——过滤器你怎么看?
- 关于闭包的问题
- 【转】一个程序员应该具备的基础知识和概念
- Spring boot 和 mybatis 学习笔记2--Mapper XML (静态)
- bzoj2014
- HTTP网络请求原理 (二) Http报文格式解析