最长上升子序列

非常经典的问题。

给定的整数序列，请求出其最长上升子序列的长度。

有多个测试用例。每个测试用例由一个行整数组成，其中第一个是一个整数 n (1 ≤ n ≤ 10000)，表示给定序列的长度。然后是 n 个 32-bits 带符号整数表示序列中的元素。

输入直至没有数据或者遇到长度 n 是非正数为止。

-Increase in the longest sequence is a classic problem. A given integer sequence, request an increase of its maximum length sequence. There are a number of test cases. Each test case by a line integral of the first of which is an integer n (1 ≤ n ≤ 10000), said that the length of a given sequence. Then the n-32-bits signed integer element of that sequence. Until there is no data input length n, or encountered a non-positive so far.