Longest increasing subarray and subsequence

Two warm-ups on one array:

1. The longest strictly increasing contiguous run (for 1, 2, 1, 2, 3 it is 1, 2, 3).
2. The longest increasing subsequence, whose elements need not be adjacent: first in quadratic time, then in O(n log n) with patience-style binary search.