Maximum Manhattan Distances

CSESGeometryOpen on judge ↗

A set is initially empty and n points are added to it. Calculate the maximum Manhattan distance of two points after each addition. Input The first line has an integer n: the number of points. The following n lines describe the points. Each line has two integers x and y. You can assume that each point is distinct. Output After each addition, print the maximum distance. Constraints - 1 \le 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.

voice by Sarvam AI