Greatest Common Increasing Subsequence
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
2
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int n,m,a[505],b[505],dp[505][505];
int LICS()
{
int MAX,i,j;
memset(dp,0,sizeof(dp));
for(i = 1; i<=n; i++)//以a[i]结尾的最大LICS长度
{
MAX = 0;
for(j = 1; j<=m; j++)
{
dp[i][j] = dp[i-1][j];
if(b[j]<a[i] && MAX<dp[i-1][j])//b[j]<a[i] 因为要找b【】中递增的子序列;
{ //所以在a[i] == b[j]之前找出b[j] < a[i]的最大值;
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];
return MAX;
}
int main()
{
int i,t;
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]);
printf("%d\n",LICS());
if(t)
printf("\n");
}
return 0;
}
//可以把dp变成一维的