# ---
# title: 1014. Best Sightseeing Pair
# id: problem1014
# author: Indigo
# date: 2021-01-30
# difficulty: Medium
# categories: Array
# link: <https://leetcode.com/problems/best-sightseeing-pair/description/>
# hidden: true
# ---
# 
# 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:**
# 
#   1. `2 <= A.length <= 50000`
#   2. `1 <= A[i] <= 1000`
# 
# 
## @lc code=start
using LeetCode

function max_score_sightseeing_pair(A::Vector{Int})
    res, mx = 0, A[1] + 0
    for j in 2:length(A)
        res = max(res, A[j] - j + 1 + mx)
        mx = max(mx, A[j] + j - 1)
    end
    res
end
## @lc code=end
