Time limit: 1.0s
Memory limit: 16M
Given an array of integers, find the longest increasing subsequence.
A subsequence is just a collection of numbers from the array - however, they must be in order.
The longest increasing subsequence here is (or , or ).
The numbers must be strictly increasing - no two numbers can be equal.
, the number of integers.
lines, each with a value in the array.
The length of the longest increasing subsequence of the array.