HDU 1159 Common Subsequence
来源:互联网 发布:java解压包的后缀 编辑:程序博客网 时间:2024/05/01 19:29
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.
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.
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.
Sample Input
abcfbc abfcabprogramming contest abcd mnp
Sample Output
420
最长公共子序列
#include<cstdio>#include<cstring>#include<iostream>#include<queue>#include<vector>#include<map>#include<cmath>#include<algorithm>using namespace std;const int maxn = 1005;char a[maxn], b[maxn];int f[maxn][maxn];int main(){ while (scanf("%s%s", a, b) != EOF) { for (int i = 0; a[i]; i++) for (int j = 0; b[j]; j++) if (a[i] == b[j]) f[i + 1][j + 1] = f[i][j] + 1; else f[i + 1][j + 1] = max(f[i][j + 1], f[i + 1][j]); printf("%d\n", f[strlen(a)][strlen(b)]); } return 0;}
0 0
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- Common Subsequence hdu 1159
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- 哈工大操作系统实验6—内存管理
- POJ 3322 Bloxorz I
- C# Action和Func
- 03-NSTimer的简单使用
- 1.文件IO函数练习及注意事项
- HDU 1159 Common Subsequence
- HDU 1243 反恐训练营
- 自动取款机中的秘钥介绍
- 学生反馈
- 1087 1 10 100 1000
- java static关键字
- HDU 1080 Human Gene Functions
- MiniTwitter记住密码功能实现
- QWebView崩溃 “Qt5WebKitd.dll!WTFCrash() 行 345C++” 的解决方法