Lovely Permutation

CodeChefOpen on judge ↗

Low-Budget Larry wants to impress a girl by gifting her a lovely permutation but with minimum amount of money. Larry has a number k and an array of size n which is a permutation. With one penny Larry can increase or decrease value of any element of the array by 1. A lovely permutatation is a permutation where the element at $i^{th}$ index (consider 0 base indexing) should be in range of i - k t

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