【C++贪心】Boxes and Candies

最新推荐文章于 2025-03-07 18:56:17 发布

原创最新推荐文章于 2025-03-07 18:56:17 发布 · 450 阅读

8 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #开发语言

文章描述了一种问题，给定一排N个盒子中初始的糖果数量，目标是通过吃掉糖果使任何两个相邻盒子的糖果总数不超过x。给出了一个C++程序解决该问题，求解最小操作次数。

题目描述

There are N boxes arranged in a row. Initially, the i-th box from the left contains ai candies.
Snuke can perform the following operation any number of times:
Choose a box containing at least one candy, and eat one of the candies in the chosen box.
His objective is as follows:
Any two neighboring boxes contain at most x candies in total.
Find the minimum number of operations required to achieve the objective.

Constraints
2≤N≤10^5
0≤ai≤10^9
0≤x≤10^9

输入

The input is given from Standard Input in the following format:
N x
a1 a2 … aN

输出

Print the minimum number of operations required to achieve the objective.

样例输入 Copy

3 3
2 2 2

样例输出 Copy

提示

Eat one candy in the second box. Then, the number of candies in each box becomes (2,1,2).

#include <cstdio>
const int N = 1e5 + 10;
int a[N];
int main()
{
	int n, x;
	scanf("%d%d", &n, &x);
	long long ans = 0;
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	for (int i = 1; i <= n; i++)
	{
		if (a[i] + a[i - 1] > x)
		{
			ans += a[i] + a[i - 1] - x;
			a[i] -= a[i] + a[i - 1] - x;
		}
	}
	printf("%lld\n", ans);
	return 0;
}