Dist Max

AtCoder

IDabc178_e

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

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

API Response (JSON)

{
  "problem": {
    "name": "Dist Max",
    "description": {
      "content": "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 ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc178_e"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "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 ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments