codeforces 732C - Sanatorium

最新推荐文章于 2019-08-09 15:02:42 发布

这个做不了。

最新推荐文章于 2019-08-09 15:02:42 发布

阅读量462

点赞数

CC 4.0 BY-SA版权

分类专栏：大学竞赛文章标签： codeforces ACM

本文链接：https://blog.youkuaiyun.com/ShiWaiGaoRen12345/article/details/52884724

大学竞赛专栏收录该内容

210 篇文章

订阅专栏

本文介绍了一个有趣的算法问题：通过记录的早餐、晚餐和夜宵次数，推算出一个人在度假期间可能错过的最少餐食数。文章提供了一段AC代码作为解答，并解释了如何根据最大就餐次数来计算缺失的餐次。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

C. Sanatorium

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard 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.

AC代码：

# include <iostream>
# include <algorithm> 
using namespace std;
typedef long long int ll;
int main(){
    ll a, b, c;
    cin >> a >> b >> c;
	ll m = max(a, max(b, c));
	ll ans = 0;
	if (a < m) ans += m - 1 - a;
	if (b < m) ans += m - 1 - b;
	if (c < m) ans += m - 1 - c;
	cout << ans << endl;
	return 0;
}