1433. Optimal Parking
来源:互联网 发布:数据分析用什么工具 编辑:程序博客网 时间:2024/06/07 05:30
1433. Optimal Parking
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
#include <iostream>using namespace std;int main(){int t;cin>>t;while(t--){int m,temp,min=100,max=-1;cin>>m;for(int i=1;i<=m;i++){cin>>temp;if(temp>max) max=temp;if(temp<min) min=temp;}cout<<(max-min)*2<<endl;}return 0;}
- 1433. Optimal Parking
- [sicily]1433. Optimal Parking
- sicily 1433. Optimal Parking
- Optimal Parking
- Optimal Parking
- Optimal Parking
- Optimal Parking
- POJ 3632 Optimal Parking
- poj3632 Optimal Parking!
- poj 3632 Optimal Parking
- hdu 1673 Optimal Parking
- HDU1673:Optimal Parking
- hdu 1673 Optimal Parking
- HDU1673 Optimal Parking
- hdu1673 Optimal Parking
- 比赛 C - Optimal Parking
- Optimal Parking 1673
- HDU1673 Optimal Parking【水题】
- DataInputStream和DataOutputStream类
- Spring没有注入
- subversion 管理
- CMD 环境变量
- 时间的尺子,随想
- 1433. Optimal Parking
- 1.0.x-学习Opencv与MFC混合编程之---视频运动检测
- python的一个小技巧
- Trac 经验谈之(6完)插件篇补遗
- var目录
- 流行权限管理 gem Devise简介
- 流行的权限管理 gem devise的定制
- rails3.1下使用devise
- 第二章之“选择排序”