Problem:
Score : 1200 points

Problem Statement

#nck {
width: 30px;
height: auto;
}

Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear is located at x_i. The maximum moving speed of the player is 1 while the bears do not move at all.

When the player gives a candy to a bear, it will provide a coin after T units of time. More specifically, if the i-th bear is given a candy at time t, it will put a coin at its position at time t+T. The purpose of this game is to give candies to all the bears, pick up all the coins, and go to the exit. Note that the player can only give a candy to a bear if the player is at the exact same position of the bear. Also, each bear will only produce a coin once. If the player visits the position of a coin after or at the exact same time that the coin is put down, the player can pick up the coin. Coins do not disappear until collected by the player.

Shik is an expert of this game. He can give candies to bears and pick up coins instantly. You are given the configuration of the game. Please calculate the minimum time Shik needs to collect all the coins and go to the exit.

Constraints

1 \leq N \leq 100,000

1 \leq T, E \leq 10^9

0 < x_i < E

x_i < x_{i+1} for 1 \leq i < N

All input values are integers.

Partial Scores

In test cases worth 600 points, N \leq 2,000.

Input

The input is given from Standard Input in the following format:

N E T
x_1 x_2 ... x_N

Output

Print an integer denoting the answer.

Sample Input 1

3 9 1
1 3 8

Sample Output 1

12

The optimal strategy is to wait for the coin after treating each bear. The total time spent on waiting is 3 and moving is 9. So the answer is 3 + 9 = 12.

Sample Input 2

3 9 3
1 3 8

Sample Output 2

16

Sample Input 3

2 1000000000 1000000000
1 999999999

Sample Output 3

2999999996

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

//============================================================================
// Author       : Sun YaoFeng
//============================================================================

//#pragma 	comment(linker, "/STACK:100240000,100240000")
//#include	<cstdio>
//#include	<cstdlib>
//#include	<cstring>
//#include	<algorithm>

#include	<bits/stdc++.h>

using	namespace	std;

#define DB		double
#define	lf		else if
#define I64		long long
#define	Rd()	(rand()<<15|rand())
#define For(i,a,b)	for(int i=a,lim=b;i<=lim;i++)
#define Rep(i,a,b)	for(int i=a,lim=b;i>=lim;i--)

#define	fi	first
#define se	second
#define MK	make_pair
#define PA	pair<int, int>

//#define	min(a,b)	((a)<(b)?(a):(b))
//#define	max(a,b)	((a)<(b)?(b):(a))

#define	CH	(ch=getchar())
int		IN()	{
		int x= 0, f= 0, ch;
		for	(; CH < '0' || ch > '9';)	f= (ch == '-');
		for	(; ch >= '0' && ch <= '9'; CH)	x= x*10 + ch -'0';
		return	f? -x : x;
}

#define n	100005

int		N, E, st[n], Q[n];

I64		T, X[n], F[n];

I64		Cost(int j, int i){
		return	X[j+1] - X[j] + max(T, (X[i] - X[j+1])*2) + (X[i] - X[j+1]);
}

int		main(int argc, char* argv[]){
		N= IN();
		E= IN();
		T= IN();
		For(i, 1, N)	X[i]= IN();
		
		int h= 1, t= 1;
		st[1]= 1;	Q[1]= 0;
		
		For(i, 1, N)	{
			for	(; h < t && st[h+1] == i; h++);
			F[i]= F[Q[h]] + Cost(Q[h], i);
			
			for	(; st[t] > i && F[i] + Cost(i, st[t]) < F[Q[t]] + Cost(Q[t], st[t]); )	t--;
			
			int l= max(st[t], i), r= N+1;
			for	(; l+1 < r;)	{
				int Mid= (l+r) >> 1;
				if	(F[i] + Cost(i, Mid) < F[Q[t]] + Cost(Q[t], Mid))	r= Mid;
					else	l= Mid;
			}
			
			if	(r != N+1)	t++, Q[t]= i, st[t]= r;
		}
		
		cout << F[N] + E - X[N] << endl;
		
		return	0;
}