Common Subsequence (p1458)
来源:互联网 发布:淘宝网登录历史 编辑:程序博客网 时间:2024/05/09 02:57
明白了就很简单,
#include<iostream>#include<cstdio>#include<algorithm>#include<queue>#include<vector>#include<cmath>#include<set>#include<cstdlib>#include<cstring>#include<stack>#include<string>using namespace std;//freopen("C://i.txt","r",stdin);#define N 1001char a[N],b[N];int dp[N][N];int main(){freopen("C://i.txt","r",stdin);int i,j,k;while (cin>>a>>b){int lena=strlen(a);int lenb=strlen(b);for (i=0;i<=lena;i++){for (j=0;j<=lenb;j++){if (i==0||j==0){dp[i][j]=0;}else if (a[i-1]==b[j-1]){dp[i][j]=dp[i-1][j-1]+1; //相同时的处理,//cout<<i<<' '<<j<<endl;}else{dp[i][j]=max(dp[i-1][j],dp[i][j-1]);}}}cout<<dp[lena][lenb]<<endl;}}
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29818 Accepted: 11565
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
- Common Subsequence (p1458)
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- Common Subsequence
- 远程连接时候,提示“您的凭据不工作”
- Ext 在firefox中 上传文件的 控件的全路径 总结
- Ubuntu中的用户管理(五)授予常规用户系统管理员权限
- 经典的if..break to if else
- jquery ui rails 如何定制自己的主题?
- Common Subsequence (p1458)
- linq基本操作
- Objective-c - NSArray(NSMutableArray)
- 根据枚举值取得描述和枚举定义字符串
- POJ 1629 Time Limit Exceeded getchar() vs scanf()
- 如何度过研究生生活(转)
- 图说SQL的数据类型
- 创建CTP服务
- iOS后台播放音乐