Dist Max 2

AtCoder

IDabc215_f

Time2000ms

Memory256MB

Difficulty—

Given are $N$ distinct points in a two-dimensional plane. Point $i$ $(1 \leq i \leq N)$ has the coordinates $(x_i,y_i)$. Let us define the distance between two points $i$ and $j$ be $\mathrm{min} (|x_i-x_j|,|y_i-y_j|)$: the smaller of the difference in the $x$\-coordinates and the difference in the $y$\-coordinates. Find the maximum distance between two different points. ## Constraints * $2 \leq N \leq 200000$ * $0 \leq x_i,y_i \leq 10^9$ * $(x_i,y_i)$ $\neq$ $(x_j,y_j)$ $(i \neq j)$ * 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$ $\vdots$ $x_N$ $y_N$ [samples]

Samples

Input #1

Output #1

4

The distances between Points $1$ and $2$, between Points $1$ and $3$, and between Points $2$ and $3$ are $2$, $4$, and $1$, respectively, so your output should be $4$.

Input #2

Output #2

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Dist Max 2",
    "description": {
      "content": "Given are $N$ distinct points in a two-dimensional plane. Point $i$ $(1 \\leq i \\leq N)$ has the coordinates $(x_i,y_i)$. Let us define the distance between two points $i$ and $j$ be $\\mathrm{min} (|x_",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc215_f"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given are $N$ distinct points in a two-dimensional plane. Point $i$ $(1 \\leq i \\leq N)$ has the coordinates $(x_i,y_i)$.\nLet us define the distance between two points $i$ and $j$ be $\\mathrm{min} (|x_...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments