Give an integer array，find the longest increasing continuous subsequence in this array.
An increasing continuous subsequence:
O(n) time and O(1) extra space.
For [5, 4, 2, 1, 3], the LICS is [5, 4, 2, 1], return 4.
For [5, 1, 2, 3, 4], the LICS is [1, 2, 3, 4], return 4.
[LintCode] Longest Increasing Continuous Subsequence 最长连续递增子序列
原文：http://www.cnblogs.com/grandyang/p/5858125.html