Submission #6514821

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

int main() {
	int n,t;
	cin >> n >> t;

	int ans = 0;

	vector<int> a(n);

	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

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

	cout << ans+t << endl;
}

Submission Info

Judge Result