Educational Codeforces Round 6-A. Professor GukiZ's Robot（简单几何）

A. Professor GukiZ's Robot

time limit per test

0.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Professor GukiZ makes a new robot. The robot are in the point with coordinates (x1, y1) and should go to the point (x2, y2). 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.

Input

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.

Output

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

Sample test(s)

input

0 0
4 5

output

5

input

3 4
6 1

output

3

Note

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.

思路：

这道题目其实就是说找从A到B的最短路，经过的点最小。只要画一下图，自然会知道最小肯定是x或y轴中绝对值最大的差。

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<set>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef unsigned __int64 LL;
typedef  __int64 ll;
const int T = 100010;
const int mod = 1000000007;


int main()
{
#ifdef zsc
    freopen("input.txt","r",stdin);
#endif

	ll n,m,u,v,i,j,k;

	while(~scanf("%I64d%I64d%I64d%I64d",&n,&m,&u,&v))
	{
		printf("%I64d\n",max(abs(m-v),abs(n-u)));
	}

    return 0;
}