Common Subsequence POJ
来源:互联网 发布:英文app翻译软件 编辑:程序博客网 时间:2024/06/16 12:45
Common Subsequence
POJ - 1458A 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.
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.
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.
abcfbc abfcabprogramming contest abcd mnp
420
题意:求最长公共子序列
分析:dp两种思路,找每个字符作为结束的最大长度和作为开始的最大长度 。
收获:刚开始学习dp
#include <cstdio>#include <iostream>#include <string.h>#include <algorithm>using namespace std;char s1[5000],s2[5000];int dp[500][500];int main (){ int maxn=0; while(scanf("%s%s",s1,s2)!=EOF) { memset(dp,0,sizeof(dp)); int n=strlen(s1); int m = strlen (s2); for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(s1[i]==s2[j]) { dp[i+1][j+1]=dp[i][j]+1; } else { dp[i+1][j+1]=max(dp[i+1][j],dp[i][j+1]); } } } printf("%d\n",dp[n][m]); } return 0;}
0 0
- Common Subsequence--poj--1458
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- Common Subsequence poj 1548
- Poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ-1458-Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence
- VS2012 快速开发平台
- eclipse使用System.out.printf出现错误
- 认识MIPS架构
- Android mipmap和drawable的区别
- [LeetCode]384. Shuffle an Array
- Common Subsequence POJ
- 函数式编程含义
- 构造方法也叫做构造函数OR构造器
- OpenGL(二)加载模型
- Zookeeper基本原理
- Android LayoutInflater原理解析
- ubuntu终端的快捷键
- 硬件改动导致软件配置错误的问题(更新ing)
- apk程序运行过程图(学习笔记)