1021. Best Sightseeing Pair

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

思路：把 A[i] + A[j] + i - j 拆成2部分 A[i] + i 和 A[j] - j

然后预先计算出A[j] - j的running max

最后遍历一遍i

class Solution(object):
    def maxScoreSightseeingPair(self, A):
        """
        :type A: List[int]
        :rtype: int
        """
        helper=[v-i for i,v in enumerate(A)]
        ma = [helper[len(helper)-1]]*len(A)
        for i in range(len(helper)-2,-1,-1):
            ma[i]=max(ma[i+1], helper[i])
        
        return max([A[i]+i+ma[i+1] for i in range(0,len(A)-1)])