LeetCode：1014. 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

思路：A[i] + A[j] + i - j = A[i]+i + A[j]-j，所以该score可以看成是j之前的最大的（A[i]+i）加上当前的(A[j]-j)

代码：

class Solution {
public:
    int maxScoreSightseeingPair(vector<int>& A) {
        int n = A.size();
        int max_pre = A[0];
        int ret = 0;
        for(int j=1; j<n; j++){
            ret = max(ret, max_pre+A[j]-j);
            max_pre = max(max_pre, A[j]+j);
        }
        return ret;
    }
};