1761. Optimal Parking

单点时限: 5.0 sec

内存限制: 256 MB

When shopping on Long Street, Michael usually parks his car at some random location, and then walks to the stores he needs. Can you help Michael choose a place to park which minimises the distance he needs to walk on his shopping round?

Long Street is a straight line, where all positions are integer. You pay for parking in a specific slot, which is an integer position on Long Street. Michael does not want to pay for more than one parking though. He is very strong, and does not mind carrying all the bags around.

输入格式

The first line of input gives the number of test cases, 1 ≤ t ≤ 100. There are two lines for each test case. The first gives the number of stores Michael wants to visit, 1 ≤ n ≤ 20, and the second gives their n integer positions on Long Street, 0 ≤ xi ≤ 99.

输出格式

Output for each test case a line with the minimal distance Michael must walk given optimal parking.

样例

Input
2
4
24 13 89 37
6
7 30 41 14 39 42
Output
152
70

37 人解决,39 人已尝试。

40 份提交通过,共有 53 份提交。

2.6 EMB 奖励。

创建: 12 年,4 月前.

修改: 2 年,6 月前.

最后提交: 2 周,2 天前.

来源: NCPC 2007

题目标签