← All problemsSign in

MonkeyPower

There are $n$ trees in a row and you have been given the height of these trees. On each tree there is one monkey and each monkey have particular power to climb the tree. Power of each monkey can be calculated as $π(x)$. Where x is the total number of maximum consecutive trees (I.e. to the left of the current tree including itself also) which has height less than or equal to the height of the curre

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

Sign in to chat with the tutor and save your progress.

Sign in to start