[LeetCode] Best Sightseeing Pair

最新推荐文章于 2024-09-12 19:02:20 发布

xiaoli727

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量106

点赞数 1

分类专栏： LeetCode 文章标签：算法动态规划

本文链接：https://blog.csdn.net/sinat_24796205/article/details/119938819

版权

LeetCode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

该博客介绍了一个寻找给定景点值数组中最佳观光组合的问题。算法工程师提出了一种解决方案，通过数学优化找到最大得分对。代码实现中，使用了动态规划策略，遍历数组并维护前缀最大值，最终返回最大得分。时间复杂度为O(n)，空间复杂度为O(1)。

摘要由CSDN通过智能技术生成

Description

Best Sightseeing Pair: You are given an integer array values where values[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i between them.

The score of a pair (i < j) of sightseeing spots is values[i] + values[j] + i - j: the sum of the values of the sightseeing spots, minus the distance between them.

Return the maximum score of a pair of sightseeing spots.

Example:

Input: values = [8,1,5,2,6]
Output: 11
Explanation: i = 0, j = 2, values[i] + values[j] + i - j = 8 + 5 + 0 - 2 = 11

Solution

The basic way is to use mathematics.

According to the description: The score of a pair (i < j) of sightseeing spots is values[i] + values[j] + i - j, and our goal it to maximize the score.

Then, we modify this formula: values[i] + values[j] + i - j = (values[j] - j) + (values[i] + i).

So, the only thing for us is to find an anwser: (values[j] - j) + max(values[i] + i), where i < j.

Code

class Solution {
public:
    int maxScoreSightseeingPair(vector<int>& values) {
        int n = values.size(), prev = values[0] + 0, ans = 0;
        for(int i = 1; i < n; i++) {
            ans = max(ans, prev + values[i] - i);
            prev = max(prev, values[i] + i);
        }
        return ans;
    }
};