CodeForces-732C-Sanatorium（模拟）

C. Sanatorium
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!

Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The only thing that Vasiliy has now is a card from the dining room contaning notes how many times he had a breakfast, a dinner and a supper (thus, the card contains three integers). Vasiliy could sometimes have missed some meal, for example, he could have had a breakfast and a supper, but a dinner, or, probably, at some days he haven’t been at the dining room at all.

Vasiliy doesn’t remember what was the time of the day when he arrived to sanatorium (before breakfast, before dinner, before supper or after supper), and the time when he left it (before breakfast, before dinner, before supper or after supper). So he considers any of these options. After Vasiliy arrived to the sanatorium, he was there all the time until he left. Please note, that it’s possible that Vasiliy left the sanatorium on the same day he arrived.

According to the notes in the card, help Vasiliy determine the minimum number of meals in the dining room that he could have missed. We shouldn’t count as missed meals on the arrival day before Vasiliy’s arrival and meals on the departure day after he left.

Input
The only line contains three integers b, d and s (0 ≤ b, d, s ≤ 1018,  b + d + s ≥ 1) — the number of breakfasts, dinners and suppers which Vasiliy had during his vacation in the sanatorium.

Output
Print single integer — the minimum possible number of meals which Vasiliy could have missed during his vacation.

Examples
input
3 2 1
output
1

input
1 0 0
output
0

input
1 1 1
output
0

input
1000000000000000000 0 1000000000000000000
output
999999999999999999

Note
In the first sample, Vasiliy could have missed one supper, for example, in case he have arrived before breakfast, have been in the sanatorium for two days (including the day of arrival) and then have left after breakfast on the third day.

In the second sample, Vasiliy could have arrived before breakfast, have had it, and immediately have left the sanatorium, not missing any meal.

In the third sample, Vasiliy could have been in the sanatorium for one day, not missing any meal.

题意：某人在某天的某个时刻来到疗养院，又在之后的某天某刻离开养老院（当然他也可以来到后立即离开），每天都有早中晚三顿饭，他吃早中晚饭的数量用B，D，S表示，他并不是每天都吃这三顿饭，有些时候他可能缺席某顿饭，那么求出他缺席吃饭次数的最小值

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
const int maxn=505;
int main()
{
    long long int B,D,S;
    scanf("%I64d%I64d%I64d",&B,&D,&S);
    long long int result=0;
    if(B>D&&B>S)//如果B最大
    {
        result+=B-D-1;
        result+=B-S-1;
    }
    else if(D>B&&D>S)
    {
        result+=D-B-1;
        result+=D-S-1;
    }
    else if(S>D&&S>B)
    {
        result+=S-D-1;
        result+=S-B-1;
    }
    else if(B==D&&D==S)
    {
        result=0;
    }
    else if(B==S)
    {
        result+=B-D-1;
    }
    else if(B==D)
    {
        result+=B-S-1;
    }
    else if(S==D)
    {
        result+=S-B-1;
    }
    printf("%I64d\n",result);
    return 0;
}