HDU 1159(动态规划-最长公共子序列)
来源:互联网 发布:麦迪和艾弗森对位数据 编辑:程序博客网 时间:2024/05/17 06:15
问题描述:
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.
Input
abcfbc abfcabprogramming contest abcd mnpOutput
420
题目题意:求出俩个串的最长公共子序列
题目分析:dp[i][j]表示串s0到si 与t0到tj的最长公共子序列
if (s[i]==t[j]) dp[i+1][j+1]=dp[i][j]+1;
else dp[i+1][j+1]=max(dp[i+1][j],dp[i][j+1]);
代码如下:
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;const int maxn=1e3+100;char s[maxn],t[maxn];int dp[maxn][maxn];int main(){ while (scanf("%s%s",s,t)!=EOF) { memset (dp,0,sizeof (dp)); int n=strlen(s),m=strlen(t); for (int i=0;i<n;i++) { for (int j=0;j<m;j++) { if (s[i]==t[j]) dp[i+1][j+1]=dp[i][j]+1; else { dp[i+1][j+1]=max(dp[i+1][j],dp[i][j+1]); } } } printf("%d\n",dp[n][m]); } return 0;}
- HDU 1159 最长公共子序列问题 动态规划
- hdu 1159 Common Subsequence(动态规划:最长公共子序列)
- POJ 1458/HDU 1159 最长公共子序列 (动态规划)
- HDU 1159(动态规划-最长公共子序列)
- hdu 4681 String (动态规划-最长公共子序列)
- HDU 1423 动态规划—最长公共上升子序列
- hdu 1080 带权值的 最长公共子序列 动态规划
- 最长公共子序列&&最长公共子串---[动态规划]
- 动态规划-最长公共子序列、最长公共子串
- 动态规划之最长公共子序列
- 动态规划 ------- 最长公共子序列
- 动态规划实现最长公共子序列
- 【动态规划】最长公共子序列LCS
- 动态规划--最长公共子序列
- 动态规划:最长公共子序列
- 动态规划解决最长公共子序列
- 最长公共子序列-动态规划DP
- 动态规划--最长公共子序列
- 深度丨是的,我们正处于数字与实体混合生态的交叉路口
- 快讯 | 旷视科技Face++宣布完成C轮4.6亿美元融资,刷新AI领域融资纪录
- jsonp原理详解
- muduo::StringPiece
- 【codevs 1191】数轴染色
- HDU 1159(动态规划-最长公共子序列)
- POJ 3492 Knapsack II (最短路)
- [BZOJ]2131: 免费的馅饼 DP+树状数组
- Navi.Soft31.微信WinForm框架(含下载地址)
- CCF-CSP认证备考要点
- weka遇到java.util.zip.ZipException: invalid LOC header (bad signature)
- 当敦煌月牙泉遍布Wi-Fi:一个“新型智慧城市”打开方式是这样的
- 如果你想要“一百种”方法玩转天猫双11,这里是一份完整版指南
- 跟大师学习系统编程---操作系统加载(4)