CF620A.Professor GukiZ's Robot

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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 $x_{1},y_{1}$ ( $-10^{9}<=x_{1},y_{1}<=10^{9}$ ) — the start position of the robot.

The second line contains two integers $x_{2},y_{2}$ ( $-10^{9}<=x_{2},y_{2}<=10^{9}$ ) — the finish position of the robot.

输出格式

Print the only integer $d$ — the minimal number of steps to get the finish position.

输入输出样例

输入#1
```
0 0
4 5
```
输出#1
```
5
```
输入#2
```
3 4
6 1
```
输出#2
```
3
```

说明/提示

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.

首页