Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Problem B
Squeeze the Cylinders

Laid on the flat ground in the stockyard are a number of heavy metal cylinders with (possibly) different diameters but with the same length. Their ends are aligned and their axes are oriented to exactly the same direction.

We'd like to minimize the area occupied. The cylinders are too heavy to lift up, although rolling them is not too difficult. So, we decided to push the cylinders with two high walls from both sides.

Your task is to compute the minimum possible distance between the two walls when cylinders are squeezed as much as possible. Cylinders and walls may touch one another. They cannot be lifted up from the ground, and thus their order cannot be altered.

Figure B.1. Cylinders between two walls

Input

The input consists of a single test case. The first line has an integer $N$ $(1 \leq N \leq 500)$, which is the number of cylinders. The second line has $N$ positive integers at most 10,000. They are the radii of cylinders from one side to the other.

Output

Print the distance between the two walls when they fully squeeze up the cylinders. The number should not contain an error greater than 0.0001.

Sample Input 1

2
10 10

Sample Output 1

40.00000000

Sample Input 2

2
4 12

Sample Output 2

29.85640646

Sample Input 3

5
1 10 1 10 1

Sample Output 3

40.00000000

Sample Input 4

3
1 1 1

Sample Output 4

6.00000000

Sample Input 5

2
5000 10000

Sample Output 5

29142.13562373

The following figures correspond to the Sample 1, 2, and 3.

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int r[] = new int[n];
		for (int i = 0; i < r.length; i++) {
			r[i] = sc.nextInt();
		}
		double c[] = new double[n];
		for (int i = 0; i < c.length; i++) {
			c[i] = r[i];
			for (int j = 0; j < i; j++) {
				double t = Math.sqrt(4 * r[i] * r[j]);
				c[i] = Math.max(c[j] + t, c[i]);
			}
		}
		double max = 0;
		for (int i = 0; i < n; i++) {
			max = Math.max(max, c[i] + r[i]);
		}
		System.out.println(max);
		sc.close();
	}
}