Given an array A of positive integers, A[i] represents the value of the i-th sightseeing spot, and two sightseeing spots i and j have distance j - i between them.
The score of a pair (i < j) of sightseeing spots is (A[i] + A[j] + i - j) : the sum of the values of the sightseeing spots, minus the distance between them.
Return the maximum score of a pair of sightseeing spots.
 
Example 1:
Input: [8,1,5,2,6]
Output: 11
Explanation: i = 0, j = 2, A[i] + A[j] + i - j = 8 + 5 + 0 - 2 = 11

 
Note:

2 <= A.length <= 50000
1 <= A[i] <= 1000

```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 maxScoreSightseeingPair(self, A: List[int]) -> int:  # O(n log n)?\n        # dynamic programming / memoization solution?  => wrong!!!\n        ## [1, 2, 3, 4] => [[1, 2], [2, 3], [3, 4]]  sum: a + b - 1\n        ##                             [[1, 3], [2, 4]] sum: [a, b-1] + [b] - 1  # get midpoint and look-up left and right parts\n        ##                                  [[1, 4]] sum: [1:2] + [3:4] -1\n        \n        ### example: A = [8,1,5,2,6]\n        ## memo[dist=1]: [8+1-1=8, 1+5-1=5, 5+2-1=6, 2+6-1=7]\n        ## memp[dist=2]: [8+5-1=13]\n        # memo = {(i, i): A[i] for i in range(A)}  # (i, j) = sum(i:j)\n        # max_score = 0  # max(memo.values())\n        # for dist in range(1, len(A)):\n        #     for i in range(len(A) - dist):\n        #         # get sum\n        #         mid = (i + dist) // 2  # for pairs of dist 1 => 0, 1; mid == 0\n        #         left_sum = memo[(i, mid)]\n        #         right_sum = memo[(mid+1, i+dist)]\n        #         memo[(i, i + dist)] = left_sum + right_sum - 1\n        #         max_score = max(memo[(i, i + dist)], max_score)  # update max score\n        # return max_score\n        \n        ## idea 2: lagging and leading pointers => calc their score. Move leading on, if score goes down, move lagging next\n        lag, lead = 0, 1\n        prev_max_score = A[0]\n        prev_max_idx = 0\n        max_score = 0\n        for i in range(1, len(A)):\n            score = prev_max_score + A[i] - (i - prev_max_idx)\n            max_score = max(score, max_score)\n            if A[i] >= score - A[i]:\n                prev_max_idx = i\n                prev_max_score = A[i]\n            \n        return max_score\n\n# ex: [100, 1, 1, 1, 1....[1]*_99_, 51, 51, 1, 1, [1]*_99_, 100]\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'maxScoreSightseeingPair'
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: 5492