Largest Minimum Distance

CodeChefOpen on judge ↗

Jigo is an owner of a land. He has built $N$ stalls on his land and given his $K$ stalls to $K$ shopkeepers on rent i.e. each stall to each shopkeeper. The stalls are located along a straight line at positions x1,...,xN ($0 \leq xi \leq 10^5$). His K ($2 \leq K \leq N$) shopkeepers don't like other shopkeepers and therefore they will become aggressive towards each other once assigned a stall. To

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