HDOJ Greatest Common Increasing Subsequence(LCIS最長共通上昇サブシーケンス)
2040 ワード
Greatest Common Increasing Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6999 Accepted Submission(s): 2279
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
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6999 Accepted Submission(s): 2279
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
#include
#include
#include
#include
using namespace std;
int t,n,m;
int a[501],b[501];
int dp[501][501];
int LCIS()
{
int i,j;
int max;
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