Increasing Subarray
CodeChefOpen on judge ↗
Fluffy the squirrel just got an array as his birthday present! There are n integers in the array, a1, a2, ..., an. Fluffy doesn't like to see larger number in front of smaller numbers. Thus, he wants to choose some of the integers from the array, and destroy them. Now, for each segment of the array that contains no destroyed elements, Fluffy wants the numbers to be non-decreasing, i.e. each eleme
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.
Sign in to chat with the tutor and save your progress.
Sign in to start