#76

#include <bits/stdc++.h>

#define ln                '\n'
#define all(dat)           dat.begin(), dat.end()
#define loop(i, to)        for (int i = 0; i < to; ++i)
#define cont(i, to)        for (int i = 1; i <= to; ++i)
#define circ(i, fm, to)    for (int i = fm; i <= to; ++i)
#define foreach(i, dat)    for (__typeof(dat.begin()) i = dat.begin(); i != dat.end(); ++i)

typedef long long          num;

using namespace std;

const int nsz = 1e5;
const num inf = 0x3f3f3f3f3f3f3f3f;
int n, m, t, a[nsz + 5];
num dp[nsz + 5], ans;

void inline upd(num &a, num b) {
	a > b && (a = b);
}

int main() {
	ios::sync_with_stdio(0);
	cin >> n >> m >> t;
	cont (i, n) {
		cin >> a[i];
	}
	memset(dp, inf, sizeof(dp));
	dp[0] = 0;
	cont (i, n) {
		loop (j, i) {
			upd(dp[i], dp[j] + a[i] - a[j] + a[i] - a[j + 1] + max(0, t - (a[i] - a[j] + a[i] - a[j + 1] - a[j + 1] + a[j])) + a[i] - a[j + 1]);
		}
	}
	ans = dp[n] + m - a[n];
	cout << ans << ln;
}

Main.cpp: In function ‘int main()’:
Main.cpp:29:28: warning: overflow in implicit constant conversion [-Woverflow]
  memset(dp, inf, sizeof(dp));
                            ^