1159 Common Subsequence
来源:互联网 发布:artemis软件 编辑:程序博客网 时间:2024/06/14 06:51
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16552 Accepted Submission(s): 6922
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 <iostream>using namespace std;#include <cstring>int main(){ char a[500], b[500]; int n[500][500]; int al, bl,i, j; while(cin>>a>>b) { al = strlen(a); bl = strlen(b); for( i = 0; i<=al; i++) n[0][i] = 0; for(i = 0; i<=bl; i++) n[i][0] = 0; for(i = 1; i<=al; i++) for(j = 1; j<=bl; j++) { if(a[i-1] == b[j-1]) n[i][j] = n[i-1][j-1] +1; else (n[i][j] = n[i][j-1]>=n[i-1][j] ? n[i][j-1] : n[i-1][j]); } cout<<n[al][bl]<<endl; } return 0;}
- hdu 1159 Common Subsequence
- HDOJ 1159:Common Subsequence
- hdoj 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDOJ 1159 Common Subsequence
- HDOJ 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
- hdoj 1159 Common Subsequence
- 1159 Common Subsequence
- Common Subsequence hdu 1159
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- php扩展获取数组参数(包括二维数组)
- Mysql定期自动备份
- GetChar缓存机制剖析
- UVa 10041 - Vito's Family
- Effective C++ 学记之19 设计class犹如设计type
- 1159 Common Subsequence
- maven:把本地jar包导入到maven仓库中
- aspnet_regiis.exe 注册IIS
- Android优秀开源项目
- Android 3.0 开始有 ActionBar 特性
- 鲜为人知的编程语言的发展史(图)
- bootsrap的mixins编译错误已经在github上修复
- 毕业生档案、户籍、三方协议等问答
- 用SQL命令查看Mysql数据库大小