leetcode 1014. 最佳观光组合

class Solution {
public:
    //A[i] + i + A[j] - j
    int maxScoreSightseeingPair(vector<int>& A) {
        int maxAdd = A[0] + 0;
        int res = INT_MIN;

        for(int i = 1; i < A.size(); ++i)
        {
            res = max(res, maxAdd + A[i] - i);
            maxAdd = max(maxAdd, A[i] + i);
        }
        return res;
    }
};