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
Alternative for Binary Search in this question
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
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | Virtual_Contestant | 2020-05-09 15:31:06 | 239 | Initial revision (published) |