# Global Maximum Hackerearth

**URL:** <https://discuss.codechef.com/t/global-maximum-hackerearth/74409>\
**Category:** help\
**Tags:** binary-search\
**Created:** [August 12, 2020, 5:51am UTC](https://discuss.codechef.com/t/global-maximum-hackerearth/74409 "2020-08-12T05:51:03Z")\
**Posts on this page:** 3\
**Page:** 1

<div class="post-metadata">

**Author:** ![brij\_raj](https://discuss.codechef.com/user_avatar/discuss.codechef.com/brij_raj/32/273961_2.png) [@brij\_raj](https://discuss.codechef.com/u/brij_raj)\
**Post date:** [August 12, 2020, 5:51am UTC](https://discuss.codechef.com/t/global-maximum-hackerearth/74409/1 "2020-08-12T05:51:03Z")

</div>

> **[HackerEarth | Helping 7.6M+ developers level up and 1000+ recruiters hire top...](https://www.hackerearth.com/practice/)**
>
> HackerEarth is a global hub of 7.6M+ developers. We help companies accurately assess, interview, and hire top tech talent.

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

---

<div class="post-metadata">

**Author:** ![tamo11](https://discuss.codechef.com/user_avatar/discuss.codechef.com/tamo11/32/90787_2.png) [@tamo11](https://discuss.codechef.com/u/tamo11)\
**Post date:** [August 12, 2020, 7:06am UTC](https://discuss.codechef.com/t/global-maximum-hackerearth/74409/2 "2020-08-12T07:06:57Z")

</div>

use the following link, it has been explained properly

> **[Maximum of minimum difference of all pairs from subsequences of given size -...](https://www.geeksforgeeks.org/maximum-of-minimum-difference-of-all-pairs-from-subsequences-of-given-size/)**
>
> A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.

---

<div class="post-metadata">

**Author:** ![brij\_raj](https://discuss.codechef.com/user_avatar/discuss.codechef.com/brij_raj/32/273961_2.png) [@brij\_raj](https://discuss.codechef.com/u/brij_raj)\
**Post date:** [August 12, 2020, 12:46pm UTC](https://discuss.codechef.com/t/global-maximum-hackerearth/74409/3 "2020-08-12T12:46:58Z")

</div>

Thanks a lot.