POJ 1458 Common Subsequence (DP 动态规划)

最新推荐文章于 2021-09-12 22:21:57 发布

tiutiu2011

最新推荐文章于 2021-09-12 22:21:57 发布

阅读量301

点赞数

分类专栏： Talk is cheap Show me the code ACM-ICPC 文章标签： POJ 1458 Common Subsequence DP 动态规划

本文链接：https://blog.csdn.net/tiutiu2011/article/details/49020557

版权

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章 0 订阅

订阅专栏

ACM-ICPC

154 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <string.h>
#define MAX_LEN 1000
#define MAX(x, y) ( (x) > (y) ? (x) : (y) )

char str1[MAX_LEN];
char str2[MAX_LEN];
//lenOfLCS[i][j]表示字符串str1的i个前缀和字符串str2的j个前缀的LCS的长度
int lenOfLCS[MAX_LEN][MAX_LEN];//length of longest common subsequence

int main(){

	while (scanf("%s%s", &str1[1], &str2[1]) != EOF){
		int m = strlen(&str1[1]);
		int n = strlen(&str2[1]);
		int i, j;
		for (i = 0; i <= m; i++)
			for (j = 0; j <= n; j++)
				lenOfLCS[i][j] = 0;

		for (i = 1; i <= m; i++)
			for (j = 1; j <= n; j++)
				if (str1[i] == str2[j])
					lenOfLCS[i][j] = lenOfLCS[i - 1][j - 1] + 1;
				else 
					lenOfLCS[i][j] = MAX(lenOfLCS[i - 1][j], lenOfLCS[i][j - 1]);

		printf("%d\n", lenOfLCS[m][n]);
				
	}
	return 0;
}