No.125 - LeetCode845 - 最长山峰

class Solution {
public:
    int longestMountain(vector<int>& A) {
        int N = A.size();
        int up[N+1];
        int down[N+1];
        memset(up,0,sizeof(up));
        memset(down,0,sizeof(down));
        for(int i=1;i<N;i++){
            if(A[i] > A[i-1]) up[i] = up[i-1]+1;
        }
        for(int i=N-1;i>0;i--){
            if(A[i-1] > A[i]) down[i-1] = down[i] + 1;
        }
        int ans = 0;
        for(int i=0;i<N;i++){
            if(up[i] != 0 && down[i] != 0){
                ans = max(ans,up[i]+down[i]+1);
            }
        }
        return ans;
    }
};