Codeforces Round #377 (Div. 2) C. Sanatorium（贪心，二分）

主要是要能想到贪心策略，要尽量在后面几天考。

又因为结果肯定是单调的，一个能考完的点的右边肯定是都能考完，一个不能考完的点的左边肯定是不能考完的。所以就可以用二分。

代码：

#include<bits/stdc++.h>using namespace std;const int maxn = 1e5+5;int n, m, can[maxn], need[maxn];bool book[maxn];bool judge(int x){    memset(book, 0, sizeof(book));    int needs = 0;    for(int i = x; i >= 1; i--)    {        if(can[i] && !book[can[i]])        {            book[can[i]] = 1;            needs += need[can[i]];        }        else if(needs) needs--;        else ;    }    for(int i = 1; i <= m; i++)        if(!book[i]) return 0;    return !needs;}int main(void){    while(cin >> n >> m)    {        for(int i = 1; i <= n; i++)            scanf("%d", &can[i]);        for(int i = 1; i <= m; i++)            scanf("%d", &need[i]);        int l = 1, r = n, mid;        while(l < r)        {            mid = (l+r)/2;            if(judge(mid)) r = mid;            else l = mid+1;        }        if(judge(l)) printf("%d\n", l);        else if(judge(r)) printf("%d\n", r);        else printf("-1\n");    }    return 0;}

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 ≤ 10¹⁸,  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.