Codeforces-Edu6-A. Professor GukiZ's Robot

A. Professor GukiZ’s Robot
time limit per test0.5 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

水题， 根据分析可知，最小步数是起末位置的横纵坐标各自相减的绝对值小的那个加上彼此绝对值的差；

代码如下：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,x,y;
    int l1,l2,l;
    cin>>a>>b;   
    cin>>x>>y;
    l1=fabs(a-x);
    l2=fabs(b-y);
    if(l1>l2)
    {
        cout<<(l1-l2)+l2;
    }
    else 
    {
        cout<<(l2-l1)+l1;
    }
    return 0;
}

仅代表个人观点，不喜勿喷!