CodeForces 620A Professor GukiZ's Robot

最新推荐文章于 2022-09-05 20:10:25 发布

颜洛滨

最新推荐文章于 2022-09-05 20:10:25 发布

阅读量549

点赞数

分类专栏： ACM 文章标签： ACM CodeForces 620A Professor GukiZs Rob

本文链接：https://blog.csdn.net/xuhuanfeng232/article/details/50589125

版权

ACM 专栏收录该内容

78 篇文章 0 订阅

订阅专栏

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.

思路：简单题目，找对应坐标差值绝对值最小那个就行了

AC代码如下：

#include <iostream>
#include <cmath>
using namespace std;

int main(){

    int a,b,c,d;
    while(cin>>a>>b>>c>>d){
        int tx=abs(a-c);
        int ty=abs(b-d);
        if(tx<ty)
            cout<<ty<<endl;
        else cout<<tx<<endl;

    }
    return 0;
}