Miu needs Peace

CodeChefOpen on judge ↗

Tired of the overpopulated world, Miu - The introverted cat visits a new continent in search for a new house. There are $N$ houses lying on the **X-axis**. Their positions are given by $X$$i$ , where $i$ refers to the $i$th house. ( $1 $1$ $X$$2$ $X$$3$ ... $X$$N$ ###Output: - For each test case print the answer in a **single line**, the **maximum** Distance of Peace Miu can obtain ###Constrai

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