AtCoder Beginner Contest 056
B
NarrowRectanglesEasy
AtCoder
⌀ 0
原题
← AC →
翻译中…

Problem Statement

翻译中…

AtCoDeer the deer found two rectangles lying on the table, each with height $1$ and width $W$. If we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of $[0,1]$ and the horizontal range of $[a,a+W]$, and the second rectangle covers the vertical range of $[1,2]$ and the horizontal range of $[b,b+W]$, as shown in the following figure:

翻译中…

image

翻译中…

AtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle. Find the minimum distance it needs to be moved.

翻译中…

Constraints

翻译中…
  • All input values are integers.
  • $1≤W≤10^5$
  • $1≤a,b≤10^5$
翻译中…

Input

翻译中…

The input is given from Standard Input in the following format:

翻译中…

W a b

翻译中…

Output

翻译中…

Print the minimum distance the second rectangle needs to be moved.

翻译中…

样例

Input #1
3 2 6
Output #1
1
This input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of $1$.
Input #2
3 1 3
Output #2
0
The rectangles are already connected, and thus no move is needed.
Input #3
5 10 1
Output #3
4
题目信息
题号
abc056_b
时间限制
2 s
内存限制
256 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。