Seesaw
시간 제한2초메모리 제한1024 MB
막대 위 N개 점이 정렬된 채 주어질 때, 매번 양 끝 중 하나를 제거하면서 모든 단계의 무게중심이 구간 안에 머무르도록 하는 최소 구간 너비를 구한다.
문제
A straight stick of length is placed from the left to the right. You can ignore the weight of the stick. In total, unit weights are attached to the stick. The positions of the weights are different from each other. The position of the -th weight () is , i.e., the distance between the -th weight and the leftmost end of the stick is .
In the beginning, we have a box of width . We place the stick on the box so that the box supports the range from to of the stick (), inclusive, i.e., the range of the stick from the point whose position is to the point whose position is . Here, is satisfied. We cannot change the values of and afterward.
Next, among the weights attached to the stick, we remove the leftmost one or the rightmost one. We shall repeat this operation times. In this process, including the initial state and the final state, the barycenter of the weights attached to the stick should remain in the range from to , inclusive. Here, if weights are attached to the stick whose positions are , the position of the barycenter is .
Given the number of weights and the positions of the weights , write a program which calculates the minimum possible width of the box.
입력
Read the following data from the standard input. Given values are all integers.
출력
Write one line to the standard output. The output should contain the minimum possible width of the box. Your program is considered correct if the relative error or the absolute error of the output is less than or equal to (). The format of the output should be one of the following.
- Integer. (Example:
123,0,-2022) - A sequence consisting of an integer, the period, a sequence of numbers between and . The numbers should not be separated by symbols or spaces. There is no restriction on the number of digits after the decimal point. (Example: , -, )
제한
- .
- ().