2555. 两个线段获得的最多奖品
题目链接:2555. 两个线段获得的最多奖品
代码如下:
//参考链接:https://leetcode.cn/problems/maximize-win-from-two-segments/solutions/2909094/liang-ge-xian-duan-huo-de-de-zui-duo-jia-24uu
class Solution
{
public:
int maximizeWin(vector<int>& prizePositions, int k)
{
//dp[i] 表示右端点不超过 prizePositions[i],一条长度为 k 的线段最多可以覆盖的奖品的最大数量
vector<int> dp(prizePositions.size() + 1);
int res = 0;
for (int i = 0; i < prizePositions.size(); i++)
{
int x = lower_bound(prizePositions.begin(), prizePositions.end(), prizePositions[i] - k) - prizePositions.begin();
res = max(res, i - x + 1 + dp[x]);
dp[i + 1] = max(dp[i], i - x + 1);
}
return res;
}
};