zoukankan      html  css  js  c++  java
  • Codeforces Round #332 (Div. 2) A. Patrick and Shopping 水题

    A. Patrick and Shopping

    Time Limit: 20 Sec

    Memory Limit: 256 MB

    题目连接

    http://codeforces.com/contest/599/problem/A

    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

    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;
    }
  • 相关阅读:
    电源设计考虑的问题
    板级隔离电源
    浪涌特性
    LED
    电荷泵
    ps抠图
    cadence pcb 导入logo
    allegro pcb 设置快捷键
    【成长】今天,我也是个面试官(BIOS面试)
    【成长】---一枚研发狗的自我认知历程
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4982849.html
Copyright © 2011-2022 走看看