Submission #4028607

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;

#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl

ll n, cnt, ans, a[ohara], b, c, d, tmp, tmpp, m, h, w, x, y, sum, pos, k;
ld doua;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl;
struct edge
{
    int to, cost;
};

//-------------------------↓↓↓↓↓↓------------------------

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> n >> x;
    rep(i, n) cin >> a[i];
    rep(i, n - 1)
    {
        sum = a[i] + a[i + 1];
        if (sum <= x)
            continue;
        ll her;
        her = sum - x;
        ans += her;
        a[i + 1] -= her;
        if (a[i + 1] < 0)
        {
            ll maina;
            maina = a[i + 1];
            a[i + 1] = 0;
            a[i] += maina;
        }
    }
    Cout(ans);
    return 0;
}

Submission Info

Judge Result