Codeforces Round #332 (Div. 2) A. Patrick and Shopping 水题
2015-11-21 03:06
375 查看
A. Patrick and Shopping
Time Limit: 20 SecMemory Limit: 256 MB
题目连接
http://codeforces.com/contest/599/problem/ADescription
Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is a d1 meter long road between his house and the first shop and a d2 meter long road between his house and the second shop. Also, there is a road of length d3 directly connecting these two shops to each other. Help Patrick calculate the minimum distance that he needs to walk in order to go to both shops and return to his house.![](http://codeforces.com/predownloaded/92/83/928329b240f22061da1bb38557b8e89d32fd6c0c.png)
Patrick always starts at his house. He should visit both shops moving only along the three existing roads and return back to his house. He doesn't mind visiting the same shop or passing the same road multiple times. The only goal is to minimize the total distance traveled
Input
The first line of the input contains three integers d1, d2, d3 (1 ≤ d1, d2, d3 ≤ 108) — the lengths of the paths.
d1 is the length of the path connecting Patrick's house and the first shop;
d2 is the length of the path connecting Patrick's house and the second shop;
d3 is the length of the path connecting both shops.
Output
Print the minimum distance that Patrick will have to walk in order to visit both shops and return to his house.
Sample Input
10 20 30
Sample Output
60
HINT
题意给你从a-b的距离,a-c的距离,b-c的距离,然后问你从a走到bc然后再回到原点的最小距离是多少
题解:
只有4种情况,都考虑一下,然后就好了
代码
#include<iostream> #include<math.h> using namespace std; int main() { long long d1,d2,d3; cin>>d1>>d2>>d3; long long ans = d1+d3+d2; ans = min(ans,2LL*d1+2LL*d3); ans = min(ans,2LL*d2+2LL*d3); ans = min(ans,2LL*d2+2LL*d1); cout<<ans<<endl; }
相关文章推荐
- 网站部署之~阿里云系列汇总
- Citrix Xen300上海培训之我见
- Tomcat get 中文乱码
- linux下用CMake、make工具手动编译程序的步骤、方法
- Commons Configuration之三Properties文件
- Linux Ubuntu mysql 乱码
- centos6.5安装mysql-advanced-5.7.9-linux-glibc2.5-x86_64.tar.gz为mysql service
- linux普通用户免秘钥登陆操作
- 阿里云Linux下搭建FTP(Ubuntu适用)
- centos更换网卡设备名,以及dns相关的问题
- [置顶] OpenLayers 3 之 动态点扩散效果
- linux 打包解包 压缩解压缩
- Linux 信号处理
- hadoop学习之hive
- MVC与三层架构区别
- 浅析三层架构与MVC模式的区别
- 服务器架构图
- 解决ecshop订单管理退货时,如何做到不退邮费
- 我从其他Shell脚本中学到了什么?
- mysql5.6 rpm模式centos安装纪要