lintcode_397_最长上升连续子序列

class Solution {
public:
    /*
     * @param A: An array of Integer
     * @return: an integer
     */
    int longestIncreasingContinuousSubsequence(vector<int> &A) {
        // write your code here
        int n=A.size();
        if(n==0)
            return 0;
        if(n==1)
            return 1;
        int ax[n],in[n];
        int max=0,min=0;
        ax[0]=1;
        in[n-1]=1;
        for(int i=1;i<n;i++)
        {
            ax[i]=1;
            if(A[i]>A[i-1])
            {
                ax[i]=ax[i-1]+1;
            }
            if(max<ax[i])
                max=ax[i];
        }
        for(int i=n-2;i>=0;i--)
        {
            in[i]=1;
            if(A[i]>A[i+1])
            {
                in[i]=in[i+1]+1;
            }
            if(min<in[i])
                min=in[i];
        }
        return max>min?max:min;
    }
};