← All problemsSign in

Make Equal

CodeChefRating 1373Open on judge ↗

You are given an array $A$ of length $N$. You can perform the following operation on it: - Choose any index $i$ such that $1 \lt i \lt N$ and $A_i$ is not smaller than either of its neighbors, i.e, both $A_i \geq A_{i-1}$ and $A_i \geq A_{i+1}$ are true. Then, decrease $A_i$ by $1$. Is it possible to make all the elements of $A$ equal by performing this operation several (possibly, zero) times?

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