原创

Optimal Parking

版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/u013624794/article/details/21107269

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

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

Sample Output

152
70
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<deque>
#include<list>
using namespace std;
int main()
{
    int T,n,k,min=0,max=0;
    int a[22];
    while(scanf("%d",&T)!=EOF)
    {
        while(T--)
        {
            scanf("%d",&n);
            for(int i=0;i<n;i++)
            cin>>a[i];
            min=a[0];max=a[0];
            for(int i=0;i<n;i++)
            {
                if(min>a[i])
                min=a[i];
                if(max<a[i])
                max=a[i];
            }
            k=(max-min)*2;
            printf("%d\n",k);
        }
    }
    return 0;
}



文章最后发布于: 2014-03-12 18:54:23
展开阅读全文
0 个人打赏

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 1024 设计师: 上身试试

分享到微信朋友圈

×

扫一扫,手机浏览