题目描述
There are $N$ boxes arranged in a row. Initially, the $i$-th box from the left contains $a_i$ 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.
提示
**Clarification of the first example:**
Eat one candy in the second box. Then, the number of candies in each box becomes $(2, 1, 2)$.
**Clarification of the second example:**
For example, eat six candies in the second box, two in the fourth box, and three in the sixth box. Then, the number of candies in each box becomes $(1,0,1,0,0,1)$.