hdu 1673 Optimal Parking
来源:互联网 发布:mac 免费uml建模工具 编辑:程序博客网 时间:2024/06/08 22:33
Optimal Parking
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1215 Accepted Submission(s): 1033
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.
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>
#include<algorithm>
#include<cmath>
using namespace std;
int s[1000];
int main()
{
int cas;
cin>>cas;
while(cas--)
{
int i,n;
cin>>n;
for(i=0;i<n;i++)
cin>>s[i];
sort(s,s+n);
int min;
min=(s[n-1]-s[0])*2;
cout<<min<<endl;
}
}
- hdu 1673 Optimal Parking
- hdu 1673 Optimal Parking
- HDU 1673 Optimal Parking
- HDU 1673 Optimal Parking
- hdu-oj 1673 Optimal Parking
- HDOJ(HDU) 1673 Optimal Parking
- HDU 1673 Optimal Parking【简单题】
- 杭电 HDU ACM 1673 Optimal Parking
- hdu.1673.Optimal Parking
- Optimal Parking 1673
- [1673]:Optimal Parking
- POJ 3632 && HDU 1673 Optimal Parking(水~)
- HDU 1673 Optimal Parking(看懂就是水题)
- hdoj.1673 Optimal Parking 20141012
- Optimal Parking
- Optimal Parking
- Optimal Parking
- Optimal Parking
- [leetcode刷题系列]Maximum Depth of Binary Tree
- 【cocos2D-x学习】9.音乐炫台——音效与特效
- 看截图:给图片罩上一层半透明文字描述效果(一)DIV+CSS+SPAN 借鉴百度图片附着文字效果
- NYOJ 85题 有趣的数
- Struts2常用标签总结
- hdu 1673 Optimal Parking
- 03-打印访问者的IP地址
- [leetcode刷题系列]Minimum Depth of Binary Tree
- Oracle 11g启动服务,账户被锁定等问题的解决
- HDU 1531 差分约束
- 黑马程序员_IO输入输出流
- 手机电池电量
- 批处理文件
- 《教你玩魔方》