1014. Best Sightseeing Pair

Question

CleanShot 2024-11-11 at 15.55.50@2x.png

Code

class Solution:
    def maxScoreSightseeingPair(self, values: List[int]) -> int:
        V = len(values)
        dp = [0] * V

        max_value = 0

        for i in range(1, V):
            dp[i] = max(dp[i - 1], values[i - 1] + i - 1)
            max_value = max(max_value, dp[i] + values[i] - i)

        return max_value