public int longestIncreasingContinuousSubsequence(int[] A) {
        // Write your code here
        if (A == null || A.length == 0)
            return 0;
        int max = 1, continuous = 1;
        for (int i = 1; i < A.length; ++i) {
            if (A[i] > A[i - 1]) {
                continuous += 1;
                max = Math.max(continuous, max);
            } else {
                continuous = 1;
            }
        }
        for (int i = A.length - 1; i >= 1; --i) {
            if (A[i - 1] > A[i]) {
                continuous += 1;
                max = Math.max(continuous, max);
            } else {
                continuous = 1;
            }
        }
        return max;
    }