Alternative for Binary Search in this question

Правка en1, от 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.me/contest/754/problem/D

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Virtual_Contestant 2020-05-09 15:31:06 239 Initial revision (published)