AtCoder Beginner Contest 178
E
Dist Max
AtCoder
⌀ 1054
原题
← DF →
翻译中…

Problem Statement

翻译中…

There are $N$ points on the 2D plane, $i$-th of which is located on $(x_i, y_i)$. There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points?

翻译中…

Here, the Manhattan distance between two points $(x_i, y_i)$ and $(x_j, y_j)$ is defined by $|x_i-x_j| + |y_i-y_j|$.

翻译中…

Constraints

翻译中…
  • $2 \leq N \leq 2 \times 10^5$
  • $1 \leq x_i,y_i \leq 10^9$
  • All values in input are integers.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

N
x_1 y_1
x_2 y_2
:
x_N y_N

翻译中…

Output

翻译中…

Print the answer.

翻译中…

样例

Input #1
3
1 1
2 4
3 2
Output #1
4
The Manhattan distance between the first point and the second point is $|1-2|+|1-4|=4$, which is maximum possible.
Input #2
2
1 1
1 1
Output #2
0
题目信息
题号
abc178_e
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。