Professor GukiZ makes a new robot. The robot are in the point with coordinates (x 1, y 1) and should go to the point (x 2, y 2). In a single step the robot can change any of its coordinates (maybe both of them) by one (decrease or increase). So the robot can move in one of the 8 directions. Find the minimal number of steps the robot should make to get the finish position.
输入描述:
The first line contains two integers x1, y1 ( - 109 ≤ x1, y1 ≤ 109) — the start position of the robot.The second line contains two integers x2, y2 ( - 109 ≤ x2, y2 ≤ 109) — the finish position of the robot.
输出描述:
Print the only integer d — the minimal number of steps to get the finish position.
示例1
输入
0 0<br />4 5<br />3 4<br />6 1<br />
备注:
In the first example robot should increase both of its coordinates by one four times, so it will be in position (4, 4). After that robot should simply increase its y coordinate and get the finish position.In the second example robot should simultaneously increase x coordinate and decrease y coordinate by one three times.
加载中...