leetcode六月每日一題 leetcode1014

class Solution {
public:
    int maxScoreSightseeingPair(vector<int>& A) {
        int ans = 0, mx = A[0] + 0;
        for (int j = 1; j < A.size(); ++j) {
            ans = max(ans, mx + A[j] - j);
            // 邊遍歷邊維護
            mx = max(mx, A[j] + j);
        }
        return ans;
    }
};