How to optimize KM algorithm?
Difference between en1 and en2, changed 0 character(s)
As the title says, my KM gets TLE on the UOJ.So  I'm very doubted about the problem.So will there be someone to help me solve the problem? KM is an algorithm that solves the weighted bipartite graph maximum matching problem.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Timsei 2017-08-14 08:58:13 78
en2 English Timsei 2017-08-12 14:50:08 0 (published)
en1 English Timsei 2017-08-12 13:32:50 253 Initial revision (saved to drafts)