← ALL NOTES
Binary Search

3600. Maximize Spanning Tree Stability with Upgrades

A graph of n nodes, edges {u,v,s,must}. Mandatory (must=1) edges can't be upgraded. Any optional edge can be upgraded (double its strength), up to k upgrades total. The "stability" of a spanning tree…

Loading…