Question8-longest array mountain

Given an array arr[] with N elements, the task is to find out the longest sub-array which has the shape of a mountain.
The Longest Peak consists of elements that are initially in ascending order until a peak element is reached and beyond the peak element all other elements of the sub-array are in decreasing order.

Input: arr = [2, 2, 2] 
Output: 0 
Explanation: 
No sub-array exists that shows the behaviour of a mountain sub-array.

Input: arr = [1, 3, 1, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5] 
Output: 11 

def LongestPeak(A):
        N = len(A)
        result = base = 0

        while base < N:
            end = base
            if end + 1 < N and A[end] < A[end + 1]:
                
                while end+1 < N and A[end] < A[end+1]:
                    end += 1

                if end + 1 < N and A[end] > A[end + 1]: 
                    
                    while end+1 < N and A[end] > A[end+1]:
                        end += 1
                   
                    result = max(result, end - base + 1)

            base = max(end, base + 1)

        return result
if __name__ == "__main__":
  d = [ 1, 3, 1, 4, 5, 6,  
        7, 8, 9, 8, 7, 6, 5 ]
  print(LongestPeak(d))