- 1. Sort the edges in increasing order
2.binary search on the sorted list
3.check if using d = Edge[mid] , can we cover all the points using S satellites ( or disconnected regions )
How to do ??? We have a sorted list , use kruskal to find the disconnected regions
Solution order : Sorting time ( O (n^2 log n) )
All about problems in Volume 103. If there is a thread about your problem, please use it. If not, create one with its number in the subject.
Moderator: Board moderators