题号：NC200218
时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
有
个盒子排成一行。最开始第
个盒子有
颗糖果，牛牛接下来会执行一个操作:
选择一个有糖果的盒子，吃一颗这个盒子内的糖果。
牛牛的目标是: 最终使得任意两个相邻的盒子的糖果数之和都小于等于
。
选择一个有糖果的盒子，吃一颗这个盒子内的糖果。
牛牛的目标是: 最终使得任意两个相邻的盒子的糖果数之和都小于等于
牛牛想知道他最少需要多少次操作达到目标。
There are boxes in a single line, and the i-th box has candies.
Niuniu will choose a box which is not empty and eats one of the candies in it.
He wants to know the minimum steps to make the number of candies from any two adjacent boxes is less than or equal to x.
Niuniu will choose a box which is not empty and eats one of the candies in it.
He wants to know the minimum steps to make the number of candies from any two adjacent boxes is less than or equal to x.
输入描述:
输入包含两行。
第一行包含两个正整数。
接下来一行一共包括。
The input contains two lines.
The first line contains two positive integers N, x ()
The second line contains N integers
输出描述:
输出一个正整数,表示最少需要的操作次数。
A single line with one positive integer of the minimum steps.