Submission #2233556

---

Source Code Expand

#include<bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
using namespace std;
#define COUT(v) cout<<(v)<<endl
#define CIN(n)  int(n);cin >> (n)
#define YES(n) cout<<((n)? "YES" : "NO")<<endl
#define Yes(n) cout<<((n)? "Yes" : "No")<<endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible"  ) <<endl

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)

#define FOREACH(x,a) for(auto& (x) : (a) )

#define ALL(obj) (obj).begin(),(obj).end()

#define P pair<int,int>
#define I vector<int>
#define S set<int>
#define pb(v) push_back(v)
#define V vector
#define rt return
#define LL long long
int main(){
    CIN(N);
    CIN(T);
    LL ans = T;
    I vec;
    REP(a,N){
        CIN(b);
        vec.pb(b);
    }
    REP(a,N-1){
        ans += T - max(0,T - (vec.at(a+1)-vec.at(a)));
    }
    COUT(ans);
    return 0;
}

Submission Info

Judge Result