Problem:
Score : 400 points

Problem Statement

You are given N integers; the i-th of them is A_i.
Find the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.

Constraints

2 \leq N \leq 10^5

1 \leq A_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.

Sample Input 1

5
6
8
1
2
3

Sample Output 1

21

When the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.

Sample Input 2

6
3
1
4
1
5
9

Sample Output 2

25

Sample Input 3

3
5
5
1

Sample Output 3

8

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.NoSuchElementException;


/** C */
public class Main {
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		int N = sc.nextInt();

		int[] A = new int[N];
		for(int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}
		Arrays.sort(A);
		ArrayDeque<Integer> deq = new ArrayDeque<>();
		for(int i = 0; i < N; i++) {
			deq.offerLast(A[i]);
		}


		int [] X = new int[N];
		int sum = 0;

		// kisu
		if(N % 2 == 1) {
			int cen = (N / 2); // center (0 origin)
			X[cen] = deq.pollFirst();

			for(int i = 0; i < (N / 2); i++) {
				if(i % 2 == 0) {
					X[cen - 1 - i] = deq.pollLast();
					X[cen + 1 + i] = deq.pollLast();
				}else{
					X[cen - 1 - i] = deq.pollFirst();
					X[cen + 1 + i] = deq.pollFirst();
				}

				sum += Math.abs(X[cen - 1 - i] - X[cen - i]) + Math.abs(X[cen + 1 + i] - X[cen + i]);
			}

		}else {
			// gusu
			int cen = (N/2) -1;
			X[cen] = deq.pollFirst();
			for(int i = 0; i < (N / 2) -1; i++) {
				if(i % 2 == 0) {
					X[cen - 1 - i] = deq.pollLast();
					X[cen + 1 + i] = deq.pollLast();
				}else{
					X[cen - 1 - i] = deq.pollFirst();
					X[cen + 1 + i] = deq.pollFirst();
				}

				sum += Math.abs(X[cen - 1 - i] - X[cen - i]) + Math.abs(X[cen + 1 + i] - X[cen + i]);
			}
			int tmp = deq.pollLast();
			if(Math.abs(tmp - X[0]) > Math.abs(tmp - X[N-2])) {
				sum += Math.abs(tmp - X[0]);
			}else{
				sum += Math.abs(tmp - X[N-2]);
			}
		}


		//************************************/
		// ここから出力処理
		//************************************/
		PrintWriter out = new PrintWriter(System.out);


		out.println(sum);

		// 最後に必ずFlush
		out.flush();
	}
}


///** B */
//public class Main {
//	public static void main(String[] args) {
//		FastScanner sc = new FastScanner();
//		int A = sc.nextInt();
//		int B = sc.nextInt();
//		int K = sc.nextInt();
//
//
//		for(int i = 0; i < K; i++){
//			if(i % 2 == 0) {
//				// takahashi
//				if(A % 2 == 1){
//					A--;
//				}
//				B =  B + (A/2);
//				A /= 2;
//			}else {
//				// aoki
//				if(B % 2 == 1){
//					B--;
//				}
//				A += (B/2);
//				B /= 2;
//			}
//		}
//
//		//************************************/
//		// ここから出力処理
//		//************************************/
//		PrintWriter out = new PrintWriter(System.out);
//
//
//		out.println(A + " " + B);
//
//		// 最後に必ずFlush
//		out.flush();
//	}
//}

// prm A
//public class Main {
//	public static void main(String[] args) {
//		FastScanner sc = new FastScanner();
//		String S = sc.next();
//
//
////		int N = sc.nextInt();
////		int M =  sc.nextInt();
////
////		int[] ary = new int[N];
////		for(int i = 0; i < N; i++) {
////			ary[i] = sc.nextInt();
////		}
//
//
////		Queue<Integer> q = new ArrayDeque<>();
//
//		//************************************/
//		// ここから出力処理
//		//************************************/
//		PrintWriter out = new PrintWriter(System.out);
//
//		if(S.length() == 2) {
//			out.println(S);
//		}else {
//			StringBuffer sb = new StringBuffer(S);
//			out.println(sb.reverse().toString());
//		}
//
//
//		// 最後に必ずFlush
//		out.flush();
//	}
//}


///** テンプレート */
//public class Main {
//	public static void main(String[] args) {
//		FastScanner sc = new FastScanner();
//		int N = sc.nextInt();
//		int M =  sc.nextInt();
//
//		int[] ary = new int[N];
//		for(int i = 0; i < N; i++) {
//			ary[i] = sc.nextInt();
//		}
//
//		//************************************/
//		// ここから出力処理
//		//************************************/
//		PrintWriter out = new PrintWriter(System.out);
//
//
//		out.println("hoge");
//
//		// 最後に必ずFlush
//		out.flush();
//	}
//}

/** スキャン用 */
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    /** クラス内部用だよ */
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    /** クラス内部用だよ */
    private int readByte() {
    	if (hasNextByte()) {
    		return buffer[ptr++];
    	}else {
    		return -1;
    	}
    }

    /**
     * クラス内部用だよ
     * ASCII の文字の内、表示用の文字を返す関数
     *
     * @return 改行とか制御文字じゃない、表示用文字ならtrue
     * */
    private static boolean isPrintableChar(int c) {
    	return 33 <= c && c <= 126;
    }

    /**
     * @return 改行文字とか空白以外を除いた、次の文字があればtrue
     * */
    public boolean hasNext() {
    	while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
    		ptr++;
    	}
    	return hasNextByte();
    }

    /**
     *
     * @return 次の文字列
     */
    public String next() {
        if (!hasNext()) {
        	throw new NoSuchElementException();
        }

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    /**
     *
     * @return 次のLong
     */
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    /**
     *
     * @return 次のInt
     */
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }

    /**
     *
     * @return 次のDouble
     */
    public double nextDouble() {
    	return Double.parseDouble(next());
    }
}