Maximum Distance
You are given $N$ points $(x_1, y_1), (x_2, y_2), \ldots, (x_N, y_N)$. You should answer $Q$ queries. In each query, you are given a range $[f, t]$. Consider the points $(x_f, y_f), (x_{f+1}, y_{f+1}), \ldots, (x_t, y_t)$; the answer to a query is the square of the maximum Euclidean distance between any two of these points. ### Input - The first line of the input contains a single integer $N$. -
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start