[Luo Gu luogu] P3817 [Candy] A problem of the solution

Actually PJ-

method

Simulation, greedy (?), While being read count, save for a

Greedy strategy

Over again, over time the need to eat sugar eaten, so as to ensure minimum eaten sugar

Code

#include <iostream>
long long n, x, ans;//没开long long的我第一次得80
long long caddy[100005];//开long long
int main()
{
    std::cin >> n >> x;//读入
    for (long long i = 1; i <= n; i++)
    {
        std::cin >> caddy[i];
        if (caddy[i] + caddy[i - 1] > x)//如果需要吃糖
        {
            ans += caddy[i] + caddy[i - 1] - x;//算一下吃了多少糖
            caddy[i] -= caddy[i] + caddy[i - 1] - x;//把吃掉的糖去掉
        }
    }
    std::cout << ans;//输出答案
    return 0;
}