Best Sightseeing Pair
You are given an integer array values where values[i] represents the value of the i^th 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
11For i = 0 and j = 2, the score is values[i] + values[j] + i - j = 8 + 5 + 0 - 2 = 11.
Example 2
Input
values = [1,2]Output
2The only pair is i = 0 and j = 1, giving score 1 + 2 + 0 - 1 = 2.
Constraints
- 2 <= values.length <= 5 * 10^4
- 1 <= values[i] <= 1000