2013
12-21

# Optimal Parking

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.

2
4
24 13 89 37
6
7 30 41 14 39 42

152
70

mark：唬人，其实就是最大值与最小值差的两倍。

# include <stdio.h>

int main ()
{
int T, n, num ;
int max, min ;
scanf ("%d", &T) ;
while (T--)
{
scanf ("%d", &n) ;
max = -1, min = 1000 ;
while (n--)
{
scanf ("%d", &num) ;
if (num > max) max = num ;
if (num < min) min = num ;
}
printf ("%d\n", (max-min)*2) ;
}

return 0 ;
}

1. 昨天我在调试我另一个网站的时候也碰到这么一个问题，后来把文件保存为utf-8格式就好了，你也试试吧。如果可行，请给我一个回复，我要确定是不是因为编码格式引起的

2. 第2题，TCP不支持多播，多播和广播仅应用于UDP。所以B选项是不对的。第2题，TCP不支持多播，多播和广播仅应用于UDP。所以B选项是不对的。