Greatest Common Increasing Subsequence

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

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 print L - the length of the greatest common increasing subsequence of both sequences.

1

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

2

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