Optimal Parking
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1518 Accepted Submission(s): 1295
http://acm.hdu.edu.cn/showproblem.php?pid=1673
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.
#include<stdio.h>
#include<algorithm>
using namespace std;
int s[24];
int main()
{
int t,n,i;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&s[i]);
sort(s,s+n);
int ans=(s[n-1]-s[0])*2;
printf("%d\n",ans);
}
return 0;
}