A10239 | Professor GukiZ's Robot
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
In the second example robot should simultaneously increase $x$ coordinate and decrease $y$ coordinate by one three times.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted