**Longest Increasing Continuous subsequence I **

Give you an integer array (index from 0 to n-1, where n is the size of this array)，find the longest increasing continuous subsequence in this array. (The definition of the longest increasing continuous subsequence here can be from right to left or from left to right)

**Example**

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`

.

**Note**

O(n) time and O(1) extra space.

Solution:

**Longest Increasing Continuous subsequence II**

Give you an integer matrix (with row size n, column size m)，find the longest increasing continuous subsequence in this matrix. (The definition of the longest increasing continuous subsequence here can start at any row or column and go up/down/right/left any direction).

**Example**

Given a matrix:

<code>[ [1 ,2 ,3 ,4 ,5], [16,17,24,23,6], [15,18,25,22,7], [14,19,20,21,8], [13,12,11,10,9] ] </code>

return `25`

**Challenge**

O(nm) time and memory.

Solution: