// 1014. Best Sightseeing Pair

//

// You are given an integer array values where values[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i between them.

//

// The score of a pair (i < j) of sightseeing spots is values[i] + values[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: values = [8,1,5,2,6]

// Output: 11

// Explanation: i = 0, j = 2, values[i] + values[j] + i - j = 8 + 5 + 0 - 2 = 11

// Example 2:

//

// Input: values = [1,2]

// Output: 2

//

//

// Constraints:

//

// 2 <= values.length <= 5 * 104

// 1 <= values[i] <= 1000

//

// Runtime 2 ms Beats 100%

// Memory 49.3 MB Beats 88.92%

class Solution {

public int maxScoreSightseeingPair(int[] values) {

for (int i = 0; i < values.length; i++) {

values[i] = values[i] - i;

}

int maxLeft = values[0];

int max = Integer.MIN_VALUE;

for (int i = 1; i < values.length; i++) {

if (maxLeft + values[i] > max) {

max = maxLeft + values[i];

}

maxLeft = Math.max(maxLeft, values[i] + 2 * i);

}

return max;

}

}