题目传送

代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;

ll n, x, a[maxn], k = 0;
int main() {
	scanf("%lld%lld", &n, &x);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &a[i]);
	}
	for (int i = 1; i <= n; ++i) {
		while (a[i] + a[i + 1] > x) {
			a[i + 1]--;
			k++;
		}
		while (a[i] + a[i + 1] <= x)break;
	}
	printf("%lld", k);
	return 0;
}

第二和第十个点超时