Best Sightseeing Pair LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxScoreSightseeingPair(vector<int> &values) {
4
    int ans = -1e9;
5
    int maxSum = values[0];
6
    int n = values.size();
7
    for (int i = 1; i < n; i++) {
8
      ans = max(ans, maxSum + values[i] - i);
9
      maxSum = max(maxSum, values[i] + i);
10
    }
11
    return ans;
12
  }
13
};