Problem:
Score : 500 points

Problem Statement

We have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.

Two people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:

Draw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.

The game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.

X will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?

Constraints

All input values are integers.

1 \leq N \leq 2000

1 \leq Z, W, a_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N Z W
a_1 a_2 ... a_N

Output

Print the score.

Sample Input 1

3 100 100
10 1000 100

Sample Output 1

900

If X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.

Sample Input 2

3 100 1000
10 100 100

Sample Output 2

900

If X draws all the cards first, the score will be |1000 - 100| = 900.

Sample Input 3

5 1 1
1 1 1 1 1

Sample Output 3

0

Sample Input 4

1 1 1
1000000000

Sample Output 4

999999999

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.*;

public class Main {
  public static void main(String[] arg) {
    Scanner scanner = new Scanner(System.in);
    int N = scanner.nextInt();
    int Z = scanner.nextInt();
    int W = scanner.nextInt();
    a = new int[N + 2];
    a[0] = Z;
    a[1] = W;
    for (int i = 0; i < N; i++) {
      a[2 + i] = scanner.nextInt();
    }
    System.out.println(maxPlayer(0, 1));
  }

  static int[] a;
  static Map<Integer, Integer> memo = new TreeMap<Integer, Integer>();
  final static int MAX_N = 2048;

  static int pair(int z, int w) { return MAX_N * z + w; }

  /** それぞれ z 枚目, w 枚目を持っている局面での最適解 */
  static int maxPlayer(int z, int w) {
    int n = Math.max(z, w) + 1;  // 取り終わっている枚数
    if (n == a.length) return Math.abs(a[z] - a[w]);
    int pair = pair(z, w);
    if (memo.containsKey(pair)) return memo.get(pair);

    int m = 0;
    for (int i = n; i < a.length; i++) {
      m = Math.max(m, minPlayer(i, w));
    }
    memo.put(pair, m);
    return m;
  }

  static int minPlayer(int z, int w) {
    int n = Math.max(z, w) + 1;  // 取り終わっている枚数
    if (n == a.length) return Math.abs(a[z] - a[w]);
    int pair = pair(z, w);
    if (memo.containsKey(pair)) return memo.get(pair);

    int m = Integer.MAX_VALUE;
    for (int i = n; i < a.length; i++) {
      m = Math.min(m, maxPlayer(z, i));
    }
    memo.put(pair, m);
    return m;
  }
}