HDU 1159 Common Subsequence (动态规划、最长公共子序列)
2024-08-29 23:55:37
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 55301 Accepted Submission(s): 25537
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 abfcab
programming contest
abcd mnp
Sample Output
题目大意与分析
就是求最长公共子序列,动态规划即可。
dp[i][j]代表A序列前i-1个元素与B序列前j-1个元素的最长公共子序列的个数,两层循环,相等就++,否则取当前最大的
代码
#include<bits/stdc++.h> using namespace std; string x,y;
int i,j,dp[][]; int main()
{
while(cin>>x>>y)
{
memset(dp,,sizeof(dp));
for(i=;i<x.size();i++)
{
for(j=;j<y.size();j++)
{
if(x[i]==y[j])
dp[i+][j+]=dp[i][j]+;
else
dp[i+][j+]=max(dp[i+][j],dp[i][j+]);
}
}
cout<<dp[x.size()][y.size()]<<endl;
}
}
最新文章
- Android常用库
- 条件随机场理论分析CRF(Conditional Random Field)
- hibernate(二)一级缓存和三种状态解析
- 一头扎进EasyUI
- c#删除转义字符的方法,删除\0后所有字符串(菜鸟级别)
- K-近邻算法python实现
- hibernate的事务管理和session对象的详解
- linux下crontab的使用
- Linux nfs下载安装与简单配置
- ie11~ie9兼容的布局写法。bootsteap的12栅格,栅格化就可以实现。
- CSS-图片占位的技巧
- 「2017 Multi-University Training Contest 2」2017多校训练2
- sudo: unable to execute ./script.sh: no such file or directory
- python学习小记
- 手机端3d旋转木马效果+保存图片到本地
- 【LOJ】#2278. 「HAOI2017」字符串
- IDEA 单元测试 导入JUnit4到项目
- 20155217 《信息安全系统设计基础》week16课堂测试
- 框架-springmvc源码分析(二)
- Framwork框架日志与配置工具的使用