Sanatorium Codeforces Round#377-C(逻辑)

最新推荐文章于 2020-08-06 17:18:36 发布

原创最新推荐文章于 2020-08-06 17:18:36 发布 · 548 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

本篇介绍了一种算法，用于计算一个人在疗养院期间可能错过的最少餐饮次数，通过输入早餐、晚餐和夜宵的用餐次数，算法能够推断出在不同到离店时间下个人可能错过的餐饮数量。

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.

题解：问的是遗漏meal数的最小次数

首先我们可以认为三个数中最大的是他在Sanatorium待的最长天数

然后开始分情况讨论如果只有一个最大的，比如早餐，那么我们就可以认定他开始是before早餐来的，然后结束时是after早餐走的，这样能使他吃其他餐的次数和最少，而他实际吃其他餐的天数是吃早餐的天数减一(想一想就明白了)

如果有两个相同且最大，那么其实就是增加了一个约束条件，譬如早餐和午餐最大，那么他开始时before早餐来的，结束时侯就必须after午餐走了。

又譬如早餐和晚餐最大，你可以认为他开始时是before晚餐来的，结束时就必须after早餐走了，这样他实际吃其他餐的天数都是最大的天数减一。

最后如果三个相同，那就特判0就可以了。

AC code：

//package C;
import java.io.*;
import java.util.*;
public class Main {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			long a=sc.nextLong();
			long b=sc.nextLong();
			long c=sc.nextLong();
			long jg=0;
			long max=a;
			int flag=1;
			if(b>=max){
				max=b;
				flag=2;
			}
			if(c>=max){
				max=c;
				flag=3;
			}
			if(flag==1){//只有a最大
				jg=a-1-b+a-1-c;
			}
			if(flag==2){
				if(a==b){
					jg=b-1-c;//a与b一样是最大
					}
				else
				jg=b-1-a+b-1-c;//只有b最大
			}
			if(flag==3){
				if(a==b&&b==c){//三个一样大
					jg=0;
					}
				else if(a==c){//a与c一样是最大
					jg=c-1-b;
					}
				else if(b==c){//b与c一样是最大
					jg=c-1-a;
					}
				else
					jg=c-1-a+c-1-b;//只有b最大
                   	}
			System.out.println(jg);
		}
	}
}