Submission #1176626

---

Source Code Expand

#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <sstream>
#include <set>
#include <map>
#include <complex>
#include <deque>
#include <cstdio>
#include <cstdlib>
#include <time.h>

using namespace std;

#define inf 999999999
#define ll long long
#define sort(a,n) sort(a,a+n)
#define fi  first
#define se second
#define pb(a) push_back(a)
#define time clock()

const ll MOD = 1000000007;
const double PI = 3.141592653589793238;

//--------------------------------------------------------------------------------------------//
int n;
int d;
int a[100000];
int b[100000];
int ans = 0;
int main(){
	cin >> n >> d;
	for (int i = 0; i < n; i++)cin >> a[i];
	for (int i = 0; i < n-1; i++)b[i] = a[i + 1] - a[i];
	for (int i = 0; i < n - 1; i++) {
		if (b[i] > d) {
			ans += d;
		}
		else {
			ans += b[i];
		}
	}
	ans += d;
	cout << ans << endl;
	//clock_t end = time;
	//cout << (double)(end - start) / CLOCKS_PER_SEC << endl;
}

Submission Info

Judge Result