寻找最长的山脉，利用动态规划的方法

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

845. Longest Mountain in Array

Medium

29711FavoriteShare

Let's call any (contiguous) subarray B (of A) a mountain if the following properties hold:

• B.length >= 3
• There exists some 0 < i < B.length - 1 such that B[0] < B[1] < ... B[i-1] < B[i] > B[i+1] > ... > B[B.length - 1]

(Note that B could be any subarray of A, including the entire array A.)

Given an array A of integers, return the length of the longest mountain. 

Return 0 if there is no mountain.

Example 1:

Input: [2,1,4,7,3,2,5]
Output: 5
Explanation: The largest mountain is [1,4,7,3,2] which has length 5.

Example 2:

Input: [2,2,2]
Output: 0
Explanation: There is no mountain.