poj 3632 Optimal Parking

Optimal Parking

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8017 Accepted: 4893

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

2424 13 89 3767 30 41 14 39 42

Sample Output

15270

Source

Nordic 2007

题意很复杂还以为是图,其实就是在一条数轴上设立很多个点,从哪个点开始走在回来并且能遍历所有的点然后求最短距离

就是从最近的点走到最远的点再回来.....

#include<iostream>#include<cstring>using namespace std;int n;int main(){int t;cin>>t;   while(t--){      cin>>n;      int a;      cin>>a;      int min1=a;      int max1=a;      for(int i=2;i<=n;i++)      {      cin>>a;        if(min1>a)min1=a;        if(max1<a)max1=a;  }  int ans=max1-min1;  cout<<ans*2<<endl;   }return 0;}