Submission #704330

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(int)(n); ++i)
#define FOR(i,n,m) for (int i=n; i<(int)(m); ++i)
#define ALL(x) x.begin(), x.end()
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define in(i, n) (0 <= (i) && (i) < (n))
#define on(bit, i) (((bit >> i) & 1) == 1)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
const int INF = 1e9+7;

int N, M, T;
int a[100];

int main(void) {
  cin >> N >> M >> T;
  REP(i, N) cin >> a[i]; 
  int res = 0;
  REP(i, N - 1) res += max(0, a[i + 1] - a[i] - 2 * M);
  res += max(0, a[0] - M);
  res += max(0, T - a[N - 1] - M);
  cout << res << endl;
  return 0;
}

Submission Info

Judge Result