← All problemsSign in

Perfection

CodeChefRating 2340Open on judge ↗

You are given a sequence of positive integers $A_1, A_2, \ldots, A_N$. You should make all its elements equal by performing a sequence of operations. In one operation, you may choose any contiguous subsequence $A_l, A_{l+1}, \ldots, A_r$ such that for each $i$ ($l+1 \le i \le r$), $A_i = A_l$, i.e. a sequence of identical elements, then choose any integer $x \lt A_l$, and for each $i$ ($l \le i

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

Sign in to chat with the tutor and save your progress.

Sign in to start