CF #377div2C 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，其中有几次饭他可能在精神病院但没有去吃
他来到精神病院的那天和走的那天时间段不确定，可能是早饭前，午饭前，晚饭前或者晚饭后
给你他三顿饭吃的次数，求他最少在精神病但没吃饭的数量

思路：
三顿饭符合规则，即没吃饭数量为0有三种情况：
1, 1 1 1 即三顿饭数量相等
2, 1 2 1 即有一个最大的，剩下两个相等且数量为最大的-1
3, 1 2 2 即有一个最小的，剩下两个相等且数量为最小的+1

所以：
若都相等，直接输出0
否则,将b，d，s排序，若最大的和次大的相等，输出最大的-1-最小的；若最大的大于次大的，输出最大的-1-次大的加上最大的-1-最小的

代码：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    long long b,d,s;
    scanf("%lld%lld%lld",&b,&d,&s);
    long long num[3];
    num[0]=b;
    num[1]=d;
    num[2]=s;
    if(b==d&&d==s)
    {
        printf("0\n");
        return 0;
    }
    sort(num,num+3);
    if(num[2]==num[1])
    {
        printf("%lld\n",num[2]-1-num[0]);
    }
    else
    {
        printf("%lld\n",(num[2]-1-num[1])+(num[2]-1-num[0]));
    }
    return 0;
}