11364 - Parking

最新推荐文章于 2019-08-02 09:31:26 发布

LILI-XU

最新推荐文章于 2019-08-02 09:31:26 发布

阅读量888

点赞数 1

分类专栏： UVa Online Judge

本文链接：https://blog.csdn.net/felixtsui/article/details/9098211

版权

UVa Online Judge 专栏收录该内容

112 篇文章 0 订阅

订阅专栏

C: 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?

$\epsfbox{p11364.eps}$

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.

Input

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

Output

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

Sample Input

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

Sample Output

152
70

#include<stdio.h>
int main()
{
	int t,n,i,a[25];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		int max=-1,min=100;
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			max=a[i]>max?a[i]:max;
			min=a[i]<min?a[i]:min;
		}
		printf("%d\n",(max-min)*2);
	}
	return 0;
}