All pairs minimax
Difference between en1 and en2, changed 11 character(s)
Given a weighted undirected graph, you have multiple queries asking for the minimum possible maximum edge between two points. How do you solve this?↵
↵
N<=100000

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English iLoveIOI 2019-11-15 10:37:57 11 Tiny change: 'nN<=100000' -> 'nN<=100000\nQ<=100000'
en2 English iLoveIOI 2019-11-15 08:31:22 11 Tiny change: 've this?\n' -> 've this?\n\nN<=100000'
en1 English iLoveIOI 2019-11-15 08:03:41 167 Initial revision (published)