CodeForces599APatrick and Shopping(数学,简易版最短路)
2016-07-21 12:50
344 查看
Description
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.
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
Input
10 20 30
Output
60
Input
1 1 5
Output
4
代码:
思路:题目是一个人要去两个超市最后返回,给你三点之间的路径问你怎么走才最近。这道题求出三个最短的路就行了。他家到a超市最短路,他家到b超市最短路,a超市到b超市最短路。三个数之和即为所求。(因为他肯定要到a和b超市,不管先到哪个都要去另一个然后从另一个返回家,所以求出这三个最短路就行了)
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.
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
Input
10 20 30
Output
60
Input
1 1 5
Output
4
代码:
#include<stdio.h> int min(int x,int y) { return x<y?x:y; } int main() { int a,b,c; int mi[10]; while(scanf("%d %d %d",&a,&b,&c)!=EOF) { mi[1]=min(a,b+c); mi[2]=min(b,a+c); mi[3]=min(a+b,c); printf("%d\n",mi[1]+mi[2]+mi[3]); } return 0; }
思路:题目是一个人要去两个超市最后返回,给你三点之间的路径问你怎么走才最近。这道题求出三个最短的路就行了。他家到a超市最短路,他家到b超市最短路,a超市到b超市最短路。三个数之和即为所求。(因为他肯定要到a和b超市,不管先到哪个都要去另一个然后从另一个返回家,所以求出这三个最短路就行了)
相关文章推荐
- Nginx RTMP 模块 nginx-rtmp-module 指令详解
- 搭建Web服务器Tomcat
- shell 多行注释详解
- tomcat监控工具Probe
- tomcat配置
- Nginx 在 Windows 平台上编译
- While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was n
- 架构设计:系统间通信(40)——自己动手设计ESB(1)
- 揭秘:攻击者如何在Kali Linux中搭建钓鱼热点 20160720
- 使用pacemaker为OpenStack组件添加HA服务(by quqi99)
- OpenJudge 迷宫问题 BFS
- SELinux开启与关闭
- java cxf org.apache.cxf.interceptor.Fault: Unmarshalling Error: null
- 在docker环境中制作openstack镜像文件
- 小记——linux时间
- 【转】js中offsetLeft,offsetTop,offsetParent详解
- 禁止外网直接访问tomcat8080端口
- 每日一linux命令(35)-------top 命令
- linux中生成shh公用密匙的方法,和快捷配置。
- 制作nginx和php的rpm包