I was trying to solve a problem named SCHEDULE from march 2017 .
The problem is based on binary search (According to the editorial).
Editorial link: SCHEDULE - Editorial
I am not able to understand how they are handling the case of non-isolated block and how they are achieving the complexity of NlogN.
Can someone please explain the editorial in an elaborate way.