Submission #4624701

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <functional>
#include <numeric>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <bitset>
#include <queue>

using namespace std;
typedef long long ll;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
#define rep(i, n) for(int i = 0;i < n;i++)
const long long INF = 1LL << 60;

int MOD = 1000000007;

int main(){
    std::ios_base::sync_with_stdio(false);

    ll n; ll x; cin >> n >> x;
    std::vector<ll> a(n); rep(i,n) cin >> a[i];

    ll ans=0LL;

    for(int i=1; i<n; ++i){
        if(a[i]+a[i-1] > x){
            if((a[i]+a[i-1])-x<=a[i]){
                ans+=a[i-1]+a[i]-x; a[i] = a[i]-(a[i-1]+a[i]-x);
            } else {
                ans+=a[i]+a[i-1]-x;
                a[i-1]=x;
                a[i] = 0LL;
            }
        }
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result