最长公共上升子序列

TimeLimit:1000MS  MemoryLimit:32768MB
64-bit integer IO format:%I64d
未提交 | 登录后收藏 | 已有4人收藏了本题
Problem Description
This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.
Input

第一行是一个整数T,代表有T组数据

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.

注意每两组数据间要留一个空行,最后一组数据后不能有空行

SampleInput
1

5
1 4 2 5 -12
4
-12 1 2 4
SampleOutput
2
Submit
题目统计信息详细
总AC数126
通过人数91
尝试人数99
总提交量327
AC率27.83%
AC该题后可以添加标签
贴完标签可以获得20ACB。
并且可以获得本题所有提交代码查看权限。
点击标题可以显示标签。
如果你还没认真思考过这题,请不要查看标签
如果您已经通过了该题,请务为该题贴上标签

T^T Online Judge

[BUG反馈] [FAQ] [闽ICP备17026590号-1]
当前版本:3.24 系统时间: