HDU 1673 Optimal Parking(看懂就是水题)
2016-05-06 13:17
453 查看
Optimal Parking
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2259 Accepted Submission(s): 1884
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
Output for each test case a line with the minimal distance Michael must walk given optimal parking.
[align=left]Sample Input[/align]
2 4 24 13 89 37 6 7 30 41 14 39 42
[align=left]Sample Output[/align]
152 70
[align=left]Source[/align]
2008
“Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(3)
题解:看了好久才看懂题意.....就是一汉子去逛商店,然后只停其中一个商店的停车场,然后走路去其他商店....求最短的走路距离....其实就是从最小到最大走两次...(看懂就是水题)
AC代码:
#include<iostream> #include<cstdlib> #include<cstdio> #include<cmath> #include<cstring> #include<string> #include<cstdlib> #include<iomanip> #include<algorithm> #include<time.h> typedef long long LL; using namespace std; int main() { int t,n,a[100]; cin>>t; while(t--) { cin>>n; for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); cout<<(a[n-1]-a[0])*2<<endl; } return 0; }
相关文章推荐
- centos7 gradle
- Linux下的sudo及其配置文件/etc/sudoers的详细配置说明
- HOW TO REMOTELY DEBUG APPLICATION RUNNING ON TOMCAT FROM WITHIN INTELLIJ IDEA
- tomcat服务器环境搭建
- Ubuntu&红帽的vim通用配置(文件头+一键编译执行C/C++/Java单文件)
- 准备工作Canopy安装Day1
- Centos 中yum常用命令讲解
- linux软件安装和卸载
- Linux操作系统普及
- 查看系统调用与信号
- 天兔(Lepus)监控操作系统(OS)配置
- nginx php fastcgi Connection reset by peer的原因及解决办法
- Linux 操作系统下如何优雅的卸载软件
- Nginx(负载均衡)+keepalived(双机热备)
- 如何邀请好友注册您的网站(模拟百度网盘)
- squid如何做正向代理,通过重定向器匹配正则重写url
- 架构设计:系统间通信(29)——Kafka及场景应用(中2)
- 服务器基础 tomcat端口被占用问题的解决
- Linux入门操作小技巧(持续更新)
- 学习下 linux