Submission #8823625

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;

#define MAX_N 100000

// int N = 3;
// int x = 3;
// int a[MAX_N] = {2, 2, 2};
int N;
long long x;
long long a[MAX_N];

int main() {
    cin >> N >> x;
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }

    long long res = 0;
    if (a[0] > x) {
        res = a[0] - x;
        a[0] = x;
    }

    for (int i = 0; i < N - 1; i++) {
        if (a[i] + a[i + 1] <= x) {
            continue;
        }
        
        // while (a[i] + a[i+1] > x) {
        //     res++;
        //     a[i + 1]--;
        // }
        long long tmp = a[i + 1] + a[i] - x;
        a[i + 1] -= tmp;
        res += tmp;
    }
    printf("%lld\n", res);
    // cout << res << endl;
}

Submission Info

Judge Result