Alternative for Binary Search in this question

Revision en1, by Virtual_Contestant, 2020-05-09 15:31:06

Given n segments, we need to choose k of them, such that intersection of chosen segments has maximum possible length. Thanks a lot. Question link : https://codeforces.com/contest/754/problem/D

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Virtual_Contestant 2020-05-09 15:31:06 239 Initial revision (published)