Global Maximum Hackerearth


I could solve this by brute force but I am not able to understand its editorial. Can anyone give me insight? More specifically -:
An interesting observation would help us in solving the problem for large n and m values. The observation is If we can obtain a subsequence of length m such that it’s currentMinimum is atleast x then we can obtain a subsequence of length m with currentMinimum strictly less than x

I am not able to understand what is written in bold. Kindly help

use the following link, it has been explained properly

1 Like

Thanks a lot.