HDU 1159 Common Subsequence(裸LCS)
2024-08-31 00:03:16
传送门:
http://acm.hdu.edu.cn/showproblem.php?pid=1159
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 47676 Accepted Submission(s): 21890
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
programming contest
abcd mnp
Sample Output
4
2
0
2
0
Source
分析:
裸的LCS(最长公共子序列问题)
code:
#include<stdio.h>
#include<string.h>
#include<memory>
using namespace std;
#define max_v 1005
char x[max_v],y[max_v];
int dp[max_v][max_v];
int l1,l2;
int main()
{
while(~scanf("%s %s",x,y))
{
l1=strlen(x);
l2=strlen(y);
memset(dp,,sizeof(dp));
for(int i=;i<=l1;i++)
{
for(int j=;j<=l2;j++)
{
if(x[i-]==y[j-])
{
dp[i][j]=dp[i-][j-]+;
}else
{
dp[i][j]=max(dp[i-][j],dp[i][j-]);
}
}
}
printf("%d\n",dp[l1][l2]);
}
return ;
}
最新文章
- php实现设计模式之 组合模式
- c++ 头文件
- CF453C Little Pony and Summer Sun Celebration (DFS)
- linux 命令(1)screen
- cocos2d-x实战 C++卷 学习笔记--第4章 win32平台下中文乱码问题
- Notification使用以及PendingIntent.getActivity() (转)
- java实现找一个数范围内所有的一
- C++之IO操作
- JSON使用与类型转换
- PowerDesigner反向生成PDM和name与注释互换
- 删除或修改本地Git保存的账号密码
- spring mvc 为什么这么多xml
- LeetCode(56):合并区间
- 在 子 iframe中 点击一个按钮, 变换 这个 iframe的地址url.
- iOS LLDB调试精解
- Android 简单计算器实现源码
- 面试题之一(Spring和堆栈和逻辑运算符)
- JavaWeb基础【1】—— Tomcat
- js获取字符串字节的位数
- Centos 从零开始 (四)