Poj 1276 Common Subsequence
来源:互联网 发布:计算机行业前景知乎 编辑:程序博客网 时间:2024/06/05 22:50
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 44452 Accepted: 18178
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
Source
Southeastern Europe 2003
/**求两个串的最长公共子序列**/
#include <stdio.h>#include <stdlib.h>#include <string.h>int max(int a, int b) { return a > b ? a : b;}char str1[1005], str2[1005];int dp[1005][1005];int main() { while(~scanf("%s %s", str1, str2)) { int len1 = (int) strlen(str1); int len2 = (int) strlen(str2); memset(dp, 0, sizeof(dp)); for(int i = 1; i <= len1; i++) { for(int j = 1; j <= len2; j++) { if(str1[i-1] == str2[j-1]) { dp[i][j] = dp[i-1][j-1] + 1; } else { dp[i][j] = max(dp[i-1][j], dp[i][j-1]); } } } printf("%d\n",dp[len1][len2]); } return 0;}
0 0
- Poj 1276 Common Subsequence
- 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
- leetcode oj java Longest Common Prefix
- 探索大型网站技术架构(二)
- vertical-align 的用法
- File回顾
- 用html5 Canvas制作一个简单的游戏 英雄抓小怪物(中)
- Poj 1276 Common Subsequence
- Android内存泄漏分析及调试
- row_number() over(partition示例
- FMDB数据库
- 高级语言的编译:链接及装载过程介绍
- iOS 多样式UILabel
- 2015-12-24
- android的super.onBackPressed()
- Android - Activity,A,B,C跳过B直接返回A