标签：605 distance int Three Codeforces ++ they total friend

链接：

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

题意：

outputstandard output
Three friends are going to meet each other. Initially, the first friend stays at the position x=a, the second friend stays at the position x=b and the third friend stays at the position x=c on the coordinate axis Ox.

In one minute each friend independently from other friends can change the position x by 1 to the left or by 1 to the right (i.e. set x:=x−1 or x:=x+1) or even don't change it.

Let's introduce the total pairwise distance — the sum of distances between each pair of friends. Let a′, b′ and c′ be the final positions of the first, the second and the third friend, correspondingly. Then the total pairwise distance is |a′−b′|+|a′−c′|+|b′−c′|, where |x| is the absolute value of x.

Friends are interested in the minimum total pairwise distance they can reach if they will move optimally. Each friend will move no more than once. So, more formally, they want to know the minimum total pairwise distance they can reach after one minute.

You have to answer q independent test cases.

思路：

中间的值影响不大，手动判断条件。

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
 
int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int a[4];
        for (int i = 1;i <= 3;i++)
            cin >> a[i];
        sort(a+1, a+4);
        if (a[1] == a[2])
        {
            if (a[3] > a[2])
                a[3]--;
            if (a[1] < a[3])
                a[1]++, a[2]++;
        }
        else if (a[2] == a[3])
        {
            if (a[1] < a[2])
                a[1]++;
            if (a[2] > a[1])
                a[2]--, a[3]--;
        }
        else
        {
            a[1]++;
            a[3]--;
        }
        int ans = a[2]-a[1]+a[3]-a[1]+a[3]-a[2];
        cout << ans << endl;
    }
 
    return 0;
}

标签：605,distance,int,Three,Codeforces,++,they,total,friend
来源： https://www.cnblogs.com/YDDDD/p/12046656.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。