LOCKDOWN TIMEPASS

CodeChefOpen on judge ↗

Ashish and Jeel are passing their time in Lockdown playing games. Given a multi-set of arrays to them (initially only one array is present). A player has to make the following move in their turn: • Select one of the arrays of size greater than 1. • Divide the array into two non-empty parts such that every element of the left array is smaller than every element of the right array. Form

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