True Game

CodeChefOpen on judge ↗

There are $N$ boxes with not necessarily distinct heights and widths which are placed in a single line. Amit and Saurav, are very competitive friends, they try to compete with each other in petty things. Amit and Saurav both start the game from different ends of the line. (Amit went to the left end and Saurav went to the right end of the line) and played a game, whosoever will travel the maximum

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