[leetcode] 1021. Best Sightseeing Pair : https://leetcode.com/problems/best-sightseeing-pair/

Best Sightseeing Pair.cpp

class Solution {
public:
    int maxScoreSightseeingPair(vector<int>& A) {
        int l = 0, r = 0;
        int answer = -1e5;
        for(int r=1; r<A.size(); r++){
            answer =max(answer, A[l] + A[r] + l - r);
            if(A[l] <= A[r] + r - l) 
                l = r;
        }
        return answer;
    }
};