poj3632

Optimal Parking Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8018 Accepted: 4894

Description

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.

Input

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 ≤ x_i ≤ 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 <iostream> #include <stdio.h> using namespace std; int main() { int T; cin>>T; while(T--) { int n; cin>>n; int a[1005]; int maxn=0; int minn=10000; int i; for(i=0;i<n;i++) { scanf("%d",&a[i]); maxn=max(a[i],maxn); minn=min(a[i],minn); } cout<<(maxn-minn)*2<<endl; } return 0; }