Longest Segment

AtCoder

IDabc234_b

Time2000ms

Memory256MB

Difficulty—

There are $N$ points in a two-dimensional plane. The coordinates of the $i$\-th point are $(x_i,y_i)$. Find the maximum length of a segment connecting two of these points. ## Constraints * $2 \leq N \leq 100$ * $-1000 \leq x_i,y_i \leq 1000$ * $(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$ $\hspace{0.4cm} \vdots$ $x_N$ $y_N$ [samples]

Samples

Input #1

Output #1

1.4142135624

For the $1$\-st and $3$\-rd points, the length of the segment connecting them is $\sqrt 2 = 1.41421356237\dots$, which is the maximum length.

Input #2

Output #2

1455.7159750446

API Response (JSON)

{
  "problem": {
    "name": "Longest Segment",
    "description": {
      "content": "There are $N$ points in a two-dimensional plane. The coordinates of the $i$\\-th point are $(x_i,y_i)$. Find the maximum length of a segment connecting two of these points.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc234_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There are $N$ points in a two-dimensional plane. The coordinates of the $i$\\-th point are $(x_i,y_i)$.\nFind the maximum length of a segment connecting two of these points.\n\n## Constraints\n\n*   $2 \\leq...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments