hdu1673 Optimal Parking
来源:互联网 发布:淘宝淘客推广 编辑:程序博客网 时间:2024/06/07 06:29
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
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<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;}
0 0
- HDU1673:Optimal Parking
- HDU1673 Optimal Parking
- hdu1673 Optimal Parking
- HDU1673 Optimal Parking【水题】
- Optimal Parking(hdu1673,水题)
- Optimal Parking
- Optimal Parking
- Optimal Parking
- Optimal Parking
- POJ 3632 Optimal Parking
- poj3632 Optimal Parking!
- 1433. Optimal Parking
- poj 3632 Optimal Parking
- hdu 1673 Optimal Parking
- hdu 1673 Optimal Parking
- 比赛 C - Optimal Parking
- Optimal Parking 1673
- HDU 1673 Optimal Parking
- 一个iOS 框架介绍:MKNetworkKit
- (译)如何优化cocos2d程序的内存使用和程序大小:第一部分
- 第一周作业——编写计算“两个整数的最大公约数”程序
- 音乐播放器3
- 取postgresql总sequence得值
- hdu1673 Optimal Parking
- 容灾系统
- javascript闭包
- 关于Android Canvas.drawText方法中的坐标参数的正确解释
- level set method 水平集方法基本问题
- 其i是 世界在变
- Android开发之旅一常用的正则表达式
- (译)如何优化cocos2d程序的内存使用和程序大小:第二部分(完)
- S3C6410 SPI全双工读写流程分析(原创)