Problem 1733 Common Subsequence(公共子序列)
来源:互联网 发布:vue.js 视频教程 编辑:程序博客网 时间:2024/05/20 02:21
Total Submit: 3062 Accepted Submit: 806
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
-----------------------------------------------------------------------------------------------------------------------------------------
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
int main()
{ freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
int i,j,m,n;
int d[200][200];
string arr1,arr2;
while(cin>>arr1>>arr2)
{
m=arr1.length();
n=arr2.length();
// memset(d,0,sizeof(int));
for(i=0;i<m;i++)
{
if(arr1[i]==arr2[0])
d[i][0]=1;
else d[i][0]=0;
if(i&&d[i][0]<d[i-1][0])
d[i][0]=d[i-1][0];
}
for(j=0;j<n;j++)
{
if(arr1[0]==arr2[j])
d[0][j]=1;
else
d[0][j]=0;
if(j&&d[0][j]<d[0][j-1])
d[0][j]=d[0][j-1];
}
/* for(i=0;i<m;i++)
{d[i][0]=(arr1[i]==arr2[0])?1:0;
if(i&&d[i][0]<d[i-1][0])
d[i][0]=d[i-1][0];
}
for(j=0;j<n;j++)
{d[0][j]=(arr1[0]==arr2[j])?1:0;
if(j&&d[0][j]<d[0][j-1])
d[0][j]=d[0][j-1];
} */
for(i=1;i<m;i++)
for(j=1;j<n;j++)
{
if(arr1[i]==arr2[j])
d[i][j]=d[i-1][j-1]+1;
else
d[i][j]=(d[i-1][j]>d[i][j-1])?d[i-1][j]:d[i][j-1];
}
cout<<d[m-1][n-1]<<endl;
}
return 0;
}
- Problem 1733 Common Subsequence(公共子序列)
- 最长公共子序列问题 Longest Common Subsequence problem
- 最长公共子序列Longest Common Subsequence
- ZJU1733 Common Subsequence - 最长公共子序列
- Common Subsequence hdu1159 最长公共子序列
- HDU Common Subsequence 最长公共子序列
- poj Common Subsequence 最长公共子序列
- POJ1458 Common Subsequence 【最长公共子序列】
- 最长公共子序列:HDU1159 Common Subsequence
- Common Subsequence(最长公共子序列)
- 最长公共子序列Common Subsequence POJ1458
- 最长公共子序列 (longest common subsequence)
- HDU1159 Common Subsequence 最长公共子序列
- Common Subsequence-最长公共子序列
- HDU 1159 Common Subsequence 公共子序列
- 最长公共子序列(Longest Common Subsequence)
- HDU Common Subsequence(最长公共子序列)
- POJ1458 Common Subsequence 最长公共子序列
- 定义类
- 最初级的堆栈溢出分析问题
- TestCompelte与QTP在Web测试方面的比较
- 电脑系统常见进程-进程管理
- 类的成员概述
- Problem 1733 Common Subsequence(公共子序列)
- Struts 的工作流程
- 常量、字段和成员属性
- LTE:全面进步 迎接商用
- 禁止MOSS页面个性化
- 世界编程语言排行榜08年01月_C++ 语言
- 关于动态规划的总结
- [错误记录]关于指针传递获得数据使用错误问题....
- Pku acm 3253 Fence Repair 数据结构题目解题报告(一) ----哈夫曼数