HDU1159 &&POJ1458最长公共子序列(字符串)
2015-08-10 10:59
344 查看
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28233 Accepted Submission(s): 12599
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.
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
简单DP
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
char a[2011],b[2011];
int max_len[2011][2011];
int main()
{
while(~scanf("%s%s",a,b))
{
int d1=strlen(a);
int d2=strlen(b);
for(int i=0; i<d1; i++)
max_len[i][0]=0;
for(int j=0; j<d2; j++)
max_len[0][j]=0;
for(int i=1; i<=d1; i++)
{
for(int j=1; j<=d2; j++)
{
if(a[i-1]==b[j-1])
max_len[i][j]=max_len[i-1][j-1]+1;
else
max_len[i][j]=max(max_len[i-1][j],max_len[i][j-1]);
}
}
cout<<max_len[d1][d2]<<endl;
}
}
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28233 Accepted Submission(s): 12599
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.
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0
简单DP
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
char a[2011],b[2011];
int max_len[2011][2011];
int main()
{
while(~scanf("%s%s",a,b))
{
int d1=strlen(a);
int d2=strlen(b);
for(int i=0; i<d1; i++)
max_len[i][0]=0;
for(int j=0; j<d2; j++)
max_len[0][j]=0;
for(int i=1; i<=d1; i++)
{
for(int j=1; j<=d2; j++)
{
if(a[i-1]==b[j-1])
max_len[i][j]=max_len[i-1][j-1]+1;
else
max_len[i][j]=max(max_len[i-1][j],max_len[i][j-1]);
}
}
cout<<max_len[d1][d2]<<endl;
}
}
相关文章推荐
- MyEclipse快捷键大全
- 多台mac公用octorpess
- Axis2开发webservice详解
- LCS 最大公共序列算法
- IOS等待时动画效果的实现
- C++ 堆排序算法
- 积跬步,聚小流------Bootstrap学习记录(1)
- Java实现数据结构之二叉查找树
- 报错为未启用当前数据库的 SQL Server Service Broker,请为此数据库启用 Service Broker
- 计算天数
- 练字心得
- poj 1458 Common Subsequence
- SQL删除所有重复数据。
- win7下编译python源码
- vs2015/mfc动态创建菜单
- java.io.IOException: Too many open files
- POJ 2955 Brackets
- 4.6向左或向右 ---RadioGroup组与onCheckedChanged事件
- 用户控件使用ViewState
- Linux下搭建Android开发环境