Codeforces Round #568 (Div. 2) A.Ropewalkers

链接：

https://codeforces.com/contest/1185/problem/A

题意：

Polycarp decided to relax on his weekend and visited to the performance of famous ropewalkers: Agafon, Boniface and Konrad.

The rope is straight and infinite in both directions. At the beginning of the performance, Agafon, Boniface and Konrad are located in positions a, b and c respectively. At the end of the performance, the distance between each pair of ropewalkers was at least d.

Ropewalkers can walk on the rope. In one second, only one ropewalker can change his position. Every ropewalker can change his position exactly by 1 (i. e. shift by 1 to the left or right direction on the rope). Agafon, Boniface and Konrad can not move at the same time (Only one of them can move at each moment). Ropewalkers can be at the same positions at the same time and can "walk past each other".

You should find the minimum duration (in seconds) of the performance. In other words, find the minimum number of seconds needed so that the distance between each pair of ropewalkers can be greater or equal to d.

Ropewalkers can walk to negative coordinates, due to the rope is infinite to both sides.

思路：

挨个计算即可

代码：

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn=2e5+7;
int main()
{
    int a,b,c,d;
    while(cin>>a>>b>>c>>d)
    {
        int result=0;
        int _max=max(max(a,b),c);
        int _min=min(min(a,b),c);
        int _mid=a+b+c-_max-_min;
        int _1=_mid-_min;
        int _2=_max-_mid;
        if(_1<d)
            result+=(d-_1);
        if(_2<d)
            result+=(d-_2);
        cout<<result<<endl;
    }
    return 0;
}

转载于:https://www.cnblogs.com/YDDDD/p/11155309.html