IEEE ROW

CodeChefOpen on judge ↗

Chintoo is playing a game with her girlfriend where he has given a row which contains some integer values. Chintoo wants to show off his girlfriend by making the row perfect in minimum steps. A perfect row is a row which is in non increasing order. In one step he can remove all elements from a row which are highest from it's all left side values. Help chintoo to find out how many steps will be

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