DP:LCS
来源:互联网 发布:耐克淘宝旗舰店正品吗 编辑:程序博客网 时间:2024/06/05 21:13
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29658 Accepted: 11496
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
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cmath>using namespace std;char x[1000];char y[1000];int dp[1001][1001];int main(){ int a,b,i,j; while(scanf("%s",x)!=EOF){ scanf("%s",y); a=strlen(x); b=strlen(y); //迭代法 for(i=1;i<=a;i++) for(j=1;j<=b;j++){ if(x[i-1]==y[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i-1][j],dp[i][j-1]); } cout<<dp[a][b]<<endl; memset(dp,0,sizeof(dp)); memset(x,0,sizeof(x)); memset(y,0,sizeof(y)); } return 0;}
- DP:LCS
- LCS-DP
- DP--LCS
- POJ1080 - DP(LCS变种)
- tyvj-1050 LCS DP
- HDU 1080 DP LCS
- lcs(dp)
- uva10192 - Vacation(dp,lcs)
- hdu 1159 dp - lcs
- poj1159 Palindrome DP,lcs
- pojAGTC(LCS,DP)
- HDU 1159 dp(lcs)
- LCS,经典DP(1159)
- lcp+dp hzau17 LCS
- SDUTOJ. LCS问题.(DP)
- poj1458 LCS 基础dp
- [DP-LCS] HDU1503
- [DP-LCS] POJ 1458
- jsessionid 问题分析
- 6月份智能手机市场份额发布:联想超华为第二逼近三星
- myeclipse加载buiding workspace慢解决方案
- Web.config 和 App.config 区别
- apache 集群tomcat配置参数说明
- DP:LCS
- 配置环境变量 及 应用
- 【最新】在windows7上搭建IIS7.5+PHP+MYSQL
- Chain Code
- XML一般操作
- JS通过onerror判断图片是否存在
- 三大运营商6月新增3G用户均大增,上半年联通新增最多
- UML 基础知识之UML的组成
- DP:The Triangle