杭电1423

最新推荐文章于 2020-09-30 05:59:59 发布

hpuzsk

最新推荐文章于 2020-09-30 05:59:59 发布

阅读量441

点赞数

分类专栏： LCIS 文章标签：杭电动态规划

本文链接：https://blog.csdn.net/z8110/article/details/49667265

版权

LCIS 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Greatest Common Increasing Subsequence

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

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

Source

ACM暑期集训队练习赛（二）

Recommend

lcy | We have carefully selected several similar problems for you: 1422 1400 1418 1424 1401

LCIS（最长公共上升子序列

#include<stdio.h>
#include<string.h>
#include<algorithm> 
using namespace std;
__int64 a[550],b[550],m,n,i,j,k,l,dp[550][550],Max;
int ac()//LCIS
{
	for(i=1;i<=m;i++)
	{
		Max=0;
		for(j=1;j<=n;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++)
	for(j=1;j<=n;j++)
	Max=max(Max,dp[i][j]);
	return Max;
}
int main()
{
	scanf("%I64d",&k);
	while(k--)
	{
		scanf("%I64d",&m);
		for(i=1;i<=m;i++)
		scanf("%I64d",&a[i]);
		scanf("%I64d",&n);
		for(i=1;i<=n;i++)
		scanf("%I64d",&b[i]);
		__int64 ans=ac();
		printf("%I64d\n",ans);
		if(k)
		printf("\n");
	}
}

）的模板题，直接上代码：