最长公共子序列问题 POJ 1458 Common Subsequence
来源:互联网 发布:uefi硬盘安装ubuntu 编辑:程序博客网 时间:2024/06/04 18:00
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45815 Accepted: 18757
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
题意:
给定两个字符串 ,求出这两个字符串最长的公共子序列的长度
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;char s[1000], t[1000];int dp[1000][1000];int len1, len2;void solve(){ for (int i = 0; i < len1; i++){ for (int j = 0; j < len2; j++){ if (s[i] == t[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]);}int main(){ while (scanf("%s%s", s, t) != EOF){ len1 = strlen(s); len2 = strlen(t); solve(); } return 0;}
0 0
- POJ 1458 Common Subsequence(最长公共子序列问题)
- POJ 1458Common Subsequence 最长公共子序列问题
- poj 1458 Common Subsequence 最长公共子序列问题
- 最长公共子序列问题 POJ 1458 Common Subsequence
- poj Common Subsequence 最长公共子序列
- 最长公共子序列(LCS, Longest Common Subsequence), POJ 1458
- POJ 1458 Common Subsequence(求最长公共子序列)
- POJ 1458 Common Subsequence.(最长公共子序列)
- POJ 1458 Common Subsequence (动规,最长公共子序列)
- Common Subsequence - POJ 1458 最长非连续公共子序列
- POJ 1458-Common Subsequence最长公共子序列
- POJ 1458 Common Subsequence (最长公共子序列)
- POJ 1458 Common Subsequence 最长公共子序列
- poj 1458 Common Subsequence dp 最长公共子序列
- POJ 1458 Common Subsequence(最长公共子序列LCS)
- poj 1458 Common Subsequence(最长公共子序列)
- POJ 1458 Common Subsequence 【最长公共子序列】
- poj 1458 Common Subsequence (LCS(最长公共子序列))
- 关于安装wamp遇到的问题
- ubuntu14.04挂载磁盘权限问题的解决(repo代码权限问题)
- Association Rules and the apriori algorithm
- 项目经理/小组长的职责
- oj1721
- 最长公共子序列问题 POJ 1458 Common Subsequence
- 正则表达式
- C语言队列的各项操作
- 4月计划
- static全局变量与普通的全局变量有什么区别?static局部变量和普通局部变量有什么区别?static函数与普通函数有什么区别?
- mesosphere/marathon/docker安装配置
- Qt标签编辑框等重叠问题
- mysqldump报错
- AD_PCB 快捷键