Strange Queries

CodeChefRating 3047Open on judge ↗

Chef has a set of integers A1, A2, ..., AN. Define the Chef's number for the set as a minimal sum of penalties of the connections between numbers from this set(each number must be connected with at least one other number), if size of the set more or equal than 2, and 0 otherwise. The connection between numbers x and y has a penalty equal the absolute value |x-y|. Chef can add elements in the set a

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