Submission #1608488

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
ll n,T,a,t[200000]={};

int main(){
	cin >> n >> T;
	REP(i,0,n) cin >> t[i];
	int s=t[n-1]+T,c=0;
	REP(i,0,n) c+=(t[i+1]-(t[i]+T)>=0?t[i+1]-(t[i]+T):0);
	cout << s-c << endl;
	return 0;
}

Submission Info

Judge Result