Maximize Two Sight Values Minus Their Index Distance

### Problem Choose two different positions i<j in `values`. Their score is `values[i]+values[j]+i-j`, combining both values and subtracting their index distance. Return the largest pair score. ```cpp class Solution { public: int maxScoreSightseeingPair(vector<int>& values); }; ``` ### Examples **Example 1:** ```text Input: values = [4,7,2] Output: 10 Explanation: Pair(0,1) scores4+7-1=10; the other two pairs score4 and8. ``` **Example 2:** ```text Input: values = [2,2] Output: 3 Explanation: The only pair scores2+2-1=3. ``` ### Constraints - `2 <= values.length <= 5*10^4`. - `1 <= values[i] <= 1000`. ### Contract considerations The result is a maximum score; the source does not ask for the maximizing indices. ```hint Read the boundary condition Separate the expression into one term depending only on i and one depending only on j. ``` ### Boundary reminders The result is a maximum score; the source does not ask for the maximizing indices.