Strictly
CodeChefOpen on judge ↗
Chef has an array $A$ of $n$ positive integers and he wants the array sequence to be strictly increasing. In one operation, Chef can increase the value of one element of the array by $1$. Since Chef is an idiot, he wants your help to find the $minimum$ number of operations that he will need to perform to make the array $strictly$ increasing sequence. Answer for $T$ test cases. Note
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.
Sign in to chat with the tutor and save your progress.
Sign in to start