hdu 1673



Optimal Parking

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1524    Accepted Submission(s): 1300

Problem 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 <= xi <= 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

2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up（3）

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  1677 1676 1672 1675 1674 

这个题目是说有一个街，街上面有很多商店，我们要选一个停车，然后全逛一遍，所以肯定要把这个街全都找一遍，所以肯定是要把这个街逛两遍，直接求街的二倍就行了。

#include<iostream>#include<stdlib.h>using namespace std;int stores[25];int cmp(const void *a,const void *b){    return *(int *)a-*(int *)b;}int main(){    int t;    int n;    cin>>t;    while(t--){        cin>>n;        int i;        for(i=0;i<n;i++)            cin>>stores[i];        qsort(stores,n,sizeof(int),cmp);        cout<<(stores[n-1]-stores[0])*2<<endl;    }    return 0;}