C++Python Greedy DP速解Leetcode 1014 Best Sightseeing Pair

C++Python Greedy DP速解Leetcode 1014  Best Sightseeing Pair算是貪婪演算還是動態規劃，其實都算解法類似Kadane演算法。

-----------

Leetcode 1014. Best Sightseeing Pair is considered greedy algorithm or dynamic programming, but it is actually both. It's similar to Kadane's Algorithm

[Py3 解答請進]

[codes on Leetcode]https://leetcode.com/problems/best-sightseeing-pair/solutions/6190941/recursive-iterative-dp-greedy-beats-100/

[DP playlist]https://www.youtube.com/watch?v=30yq3fmE6E8&list=PLYRlUBnWnd5K_XYUesV9oc6M9ONXII61T&index=1

class Solution:
    def maxScoreSightseeingPair(self, values: List[int]) -> int:
        # score=(values[i]+i)+(values[j]-j) for i<j
        # dp[i]=max(values[k]+k for k<=i)
        dp, score=0, 0
        for i, x in enumerate(values):
            score=max(score, dp+x-i)
            dp=max(dp, x+i)
        return score