poj 2127 Greatest Common Increasing Subsequence （LCIS）

最新推荐文章于 2019-06-10 16:11:00 发布

原创最新推荐文章于 2019-06-10 16:11:00 发布 · 984 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

DP、递推专栏收录该内容

87 篇文章

订阅专栏

本文介绍了一种求解两个整数序列的最长递增公共子序列问题的算法实现，通过动态规划方法寻找序列间的递增公共部分，并给出具体代码示例。

Greatest Common Increasing Subsequence

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions: 9193		Accepted: 2427
Case Time Limit: 2000MS		Special Judge

Description

You are given two sequences of integer numbers. Write a program to determine their common increasing subsequence of maximal possible length.
Sequence S ₁ , S ₂ , . . . , S _N of length N is called an increasing subsequence of a sequence A ₁ , A ₂ , . . . , A _M of length M if there exist 1 <= i ₁ < i ₂ < . . . < i _N <= M such that S _j = A _{i_j} for all 1 <= j <= N , and S _j < S _j+1 for all 1 <= j < N .

Input

Each sequence is described with M --- its length (1 <= M <= 500) and M integer numbers A _i (-2 ³¹ <= A _i < 2 ³¹ ) --- the sequence itself.

Output

On the first line of the output file print L --- the length of the greatest common increasing subsequence of both sequences. On the second line print the subsequence itself. If there are several possible answers, output any of them.

Sample Input

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

Sample Output

2
1 4

最长递增公共子序列

状态转移方程：

a[i]==b[j]时，dp[i][j]=dp[i-1][j-1]+1;
a[i]!=b[j]时，dp[i][j]=Max(dp[i-1][j],dp[i][j]);

#include"stdio.h"
#include"string.h"
#define N 505
int dp[N][N],pre[N][N];
#define Max(x,y) ((x)>(y)?(x):(y))
int main()
{
	int i,j,n,m;
	int a[N],b[N];
	int ans[N];
	while(scanf("%d",&n)!=-1)
	{
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		scanf("%d",&m);
		for(i=0;i<m;i++)
			scanf("%d",&b[i]);
		memset(dp,0,sizeof(dp));
		memset(pre,0,sizeof(pre));
		memset(ans,0,sizeof(ans));
		for(i=0;i<n;i++)
		{
			int t=0,max=0;
			for(j=0;j<m;j++)
			{
				if(a[i]==b[j])
				{
					dp[i][j]=max+1;
					pre[i][j]=t;
				}
				else
					dp[i][j]=Max(dp[i][j],dp[i-1][j]);
				if(a[i]>b[j]&&dp[i][j]>max)
				{
					max=dp[i][j];
					t=j;
				}
			}
		}
		int x=n-1,k=0,y,cnt=0;
		for(i=0;i<n;i++)
			for(j=0;j<m;j++)
				if(cnt<dp[i][j])
				{
					cnt=dp[i][j];
					y=j;
				}
		printf("%d\n",cnt);
		while(cnt--)
		{
			ans[k++]=b[y];
			while(a[x]!=b[y])
				x--;
			y=pre[x][y];
			x--;
		}
		for(i=k-1;i>=0;i--)
			printf("%d ",ans[i]);
		printf("\n");
	}
	return 0;
}