Halloween Heist

CodeChefOpen on judge ↗

It is the season of Halloween and Jake is back again to win the Halloween Heist this year. But, this year they have to solve a puzzle to take part in the Heist. Amy and Terry are really comfortable with puzzles but Jake is going crazy so he asked you to help him. There are $N$ pillars in a field. You are given a sequence of integers $A_1 , A_2 , .... A_N$ denoting the height of each pillar. You

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