hdu 1423 Greatest Common Increasing Subsequence

最新推荐文章于 2024-11-14 19:11:37 发布

叶阳雨翊

最新推荐文章于 2024-11-14 19:11:37 发布

阅读量429

点赞数

分类专栏：动态规划文章标签：最长公共上升子序列 LCIS ACM c++ 动态规划

本文链接：https://blog.csdn.net/yyyy2013_8_3/article/details/10097965

版权

动态规划专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Greatest Common Increasing Subsequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2896 Accepted Submission(s): 904

Problem Description

This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.

Input

Each sequence is described with M - its length (1 <= M <= 500) and M integer numbers Ai (-2^31 <= Ai < 2^31) - the sequence itself.

Output

output print L - the length of the greatest common increasing subsequence of both sequences.

Sample Input

  
  
   
   1

5
1 4 2 5 -12
4
-12 1 2 4

Sample Output

题意：

最长公共上升子序列（LCIS）

AC代码

#include<iostream>
using namespace std;
int dp[512][512],a[512],b[512];
int main()
{
     int i,j,t,n,m,Max,flag=0;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=1;i<=n;i++) scanf("%d",&a[i]);
		scanf("%d",&m);
		for(i=1;i<=m;i++) scanf("%d",&b[i]);
		memset(dp,0,sizeof(dp));
		for(i=1;i<=n;i++)
		{
			Max=0;
			for(j=1;j<=m;j++)
			{
				dp[i][j]=dp[i-1][j];
				if (a[i]>b[j]&&Max<dp[i-1][j])
					Max=dp[i-1][j];
				if (a[i]==b[j]) dp[i][j]=Max+1;
			}
		}
		Max=0;
		for(i=1;i<=m;i++) 
			if (Max<dp[n][i]) 
				Max=dp[n][i];
			if(flag)
				printf("\n");
		flag++;
		printf("%d\n",Max);
		
	}
	return 0;
}

谢谢阅读！