最长公共子序列(1)--hdu1159(模板)

最新推荐文章于 2024-08-01 16:52:27 发布

Sly_461

最新推荐文章于 2024-08-01 16:52:27 发布

阅读量510

点赞数 1

分类专栏：【最长公共子序列与最长公共子串】【模板】文章标签： hdu1159 最长公共子序列动态规划

本文链接：https://blog.csdn.net/Acmer_Sly/article/details/52312548

版权

【模板】同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

【最长公共子序列与最长公共子串】

5 篇文章 0 订阅

订阅专栏

Common Subsequence

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

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.

Input

abcfbc abfcab
programming contest 
abcd mnp

Output

4
2
0

Sample Input

abcfbc abfcab
programming contest 
abcd mnp

Sample Output

4
2
0

Hint

这道题就是一个简单的最长公共子序列，模板题，（不了解的可以看我上一篇博客http://blog.csdn.net/acmer_sly/article/details/52302421）比如第一个例子，两个字符串的最大子序列为abfc,就输出4.

直接上代码：

#include<stdio.h>
#include<string.h>
int Max(int a,int b){
	if(a<b)return b;
	else return a;
}
char str1[1000];
char str2[1000];
int dp[1005][1005];
int main()
{
	int i,j;
	while(scanf("%s%s",str1,str2)!=EOF)
	{
		memset(dp,0,sizeof(dp));
		int n=strlen(str1);
		int m=strlen(str2);
		for(i=1;i<=n;i++){
			for(j=1;j<=m;j++){         //注意这里，如果是从1开始循环，那字符串的下标就要减1
				if(str1[i-1]==str2[j-1])        //dp[0][0]也需赋值
					dp[i][j]=dp[i-1][j-1]+1;
				else 
					dp[i][j]=Max(dp[i-1][j],dp[i][j-1]);
			}
		}
		printf("%d\n",dp[n][m]);
	}
	return 0;
}