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

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    def maxWidthRamp(self, A: List[int]) -> int:\n        # result = 0\n        # for i in range(len(A)):\n        #     for j in range(i+1,len(A)):\n        #         if A[i]<=A[j]:\n        #             result = max(result,j-i)\n        # return result\n        # Brute Force, Time Limit Exceeded\n        \n        # two pointer\n#         rMax = [0]*len(A)\n#         rMax[-1] = A[-1]\n#         for i in range(len(A)-1)[::-1]:\n#             rMax[i] = max(rMax[i+1],A[i])        \n#         L=R=0\n#         result=0\n        \n#         while R<len(A):\n#             print(L,R,result)\n#             while L<R and A[L]>rMax[R]:\n#                 L+=1\n#             result = max(result,R-L)\n#             R+=1\n            \n#         return result\n\n        Aindex = [(a,i) for i,a in enumerate(A)]\n        Aindex.sort(key=lambda x:(x[0],x[1]))\n        mn=len(A)\n        ans=0\n        for a,i in Aindex:\n            print((i,ans,i-mn,mn))\n            ans=max(ans,i-mn)\n            mn=min(mn,i)\n        return ans\n        \n\n\n        # stack = []\n        # res = 0\n        # for i in range(len(A))[::-1]:\n        #     #print(i,stack)\n        #     if not stack or A[i] > stack[-1][0]:\n        #         stack.append([A[i], i])\n        #     else:\n        #         j = stack[bisect.bisect(stack, [A[i], i])][1]\n        #         print(stack,[A[i], i],bisect.bisect(stack, [A[i], i]),j)\n        #         res = max(res, j - i)\n        # return res\n    \n        # s = []\n        # res = 0\n        # for i, a in enumerate(A):\n        #     if not s or A[s[-1]] > a:\n        #         s.append(i)\n        # print(s)\n        # for j in range(len(A))[::-1]:\n        #     while s and A[s[-1]] <= A[j]:\n        #         res = max(res, j - s.pop())\n        # return res\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'maxWidthRamp'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 7084