hdu 1673
来源:互联网 发布:东南亚旅游推荐 知乎 编辑:程序博客网 时间:2024/06/05 23:53
Optimal Parking
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 957 Accepted Submission(s): 839
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
Source
2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(3)
Recommend
lcy
//题目意思就是从某个停车位出发购物,最终回到最初停车位所走的最短距离//将停车位排序,然后相邻相减,就是最短距离#include <iostream>#include <algorithm>using namespace std;int main(){int t, n, dis, a[21], i;scanf("%d", &t);while (t--){scanf("%d", &n);for(i = 0; i < n; i++)scanf("%d", &a[i]);sort(a, a+n);dis = abs(a[n-1] - a[0]);for(i = 1; i < n; i++)dis += abs(a[i] - a[i-1]);printf("%d\n", dis);}return 0;}
- hdu 1673
- hdu 1673
- hdu 1673
- hdu 1673 Optimal Parking
- hdu 1673 Optimal Parking
- HDU 1673 Optimal Parking
- HDU 1673 Optimal Parking
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Oracle 处理空值
- 淘宝网架构师岳旭强的年度展望
- Html4和Html5之间有什么区别,Html5有什么新功能
- 400电话和800电话是干什么用的,有什么好处?
- php5中const、define和static
- hdu 1673
- Windows消息大全使用详解
- 将shellcode 插入到PE节表的间隔中
- c语言二维数组怎么表示
- 从菜鸟蜕变成大神的几款编程工具
- adobe flash player连接调试器失败
- AutoCAD 二次开发学习系列【3】 - 注册外部命令
- C/C++中Static的作用详述
- ArcGIS中求多边形的“四至点”