human
I found an interesting problem on https://leetcode.com/problems/maximum-width-ramp/:
Given an array A of integers, a ramp is a tuple (i, j) for which i < j and A[i] <= A[j].  The width of such a ramp is j - i.
Find the maximum width of a ramp in A.  If one doesn't exist, return 0.
 
Example 1:
Input: [6,0,8,2,1,5]
Output: 4
Explanation: 
The maximum width ramp is achieved at (i, j) = (1, 5): A[1] = 0 and A[5] = 5.

Example 2:
Input: [9,8,1,0,1,9,4,0,4,1]
Output: 7
Explanation: 
The maximum width ramp is achieved at (i, j) = (2, 9): A[2] = 1 and A[9] = 1.



 
Note:

2 <= A.length <= 50000
0 <= A[i] <= 50000

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is Python code to find the maximum width of a ramp in A.

class Solution:
    def maxWidthRamp(self, A: List[int]) -> int:
        n = len(A)
        minLeft, maxRight = [A[0]] * n, [A[-1]] * n
        for i in range(1, n):
            minLeft[i] = min(minLeft[i - 1], A[i])
            maxRight[n - i - 1] = max(maxRight[n - i], A[n - i - 1])
        i = j = n - 1
        res = 0
        while i >= 0 and j >= 0:
            if minLeft[i] <= maxRight[j]:
                res = max(res, j - i)
                i -= 1
            else:
                j -= 1
        return res