HDU
来源:互联网 发布:linux cp命令略过目录 编辑:程序博客网 时间:2024/06/09 17:01
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.
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
大致题意:给你两个字符串,问你他们的最大公共子序列。
思路:直接套lcs模板
代码如下
#include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>#include<cstring>#include<string>#include<queue>#include<map>using namespace std;int dp[1005][1005];char str1[1005],str2[1005];int len1,len2;void lcs(){ 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]); }}int main(){ while(cin>>str1>>str2) { len1=strlen(str1); len2=strlen(str2); lcs(); cout<<dp[len1][len2]<<endl; } return 0;}
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- [codeforces455E]Function
- ContentProvider
- 一个txt的自我告白
- 表单序列化,获取Json对象
- 【Linux学习笔记】六、压缩解压命令
- HDU
- 配置mac版sublime text lua编译环境
- 检索blob,clob对象效率很慢。。
- React browserHistory.push时如何优雅地传参
- 前端开发推荐读书
- 栈和队列相关面试题2
- MyBaits学习——集合的嵌套查询和嵌套结果
- Set接口
- ACM进阶计划