Problem Description
This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.
This is a problem fro
阅读背景：
hdu 1423 Greatest Common Increasing Subsequence (最长上升公共子序列)
来源：互联网
分享到：
