HDU 1673 Optimal Parking
来源:互联网 发布:淘宝客下载官方网站 编辑:程序博客网 时间:2024/06/05 11:04
Optimal Parking
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<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>using namespace std;int a[100];int main(){ int t,n,i; scanf("%d",&t); while(t--) { scanf("%d",&n); int sum=0; for(i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); for(i=0;i<n;i++) { if(i) sum+=abs(a[i]-a[i-1]); } sum+=abs(a[n-1]-a[0]); printf("%d\n",sum); } return 0;}
2 0
- 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
- Unable to execute dex: Multiple dex files define 解决方法
- AppStore IPv6-only审核被拒原因分析及解决方案
- 内存管理(二)
- 更新 --- android实现自定义RelativeLayout可拖动、缩放、旋转TextView
- org.json使用
- HDU 1673 Optimal Parking
- HDU 2602 Bone Collector(背包模板)
- redis 集群
- Android,IOS中JSBridge原理
- 2016中国大学生程序设计竞赛 - 网络选拔赛 hdu5833 Zhu and 772002
- maven核心,pom.xml详解(转)
- uva221-Urban Elevations
- Retrofit
- C++学习Day1