|
|
|
|
|
|
by baddox
3861 days ago
|
|
|
You can just choose an arbitrary starting L, and if the answer is No, keep doubling your guess until the answer is Yes, then just binary search from there. Or if you want to start with the maximum possible L, just start with the sum of all the edge weights in the graph. |
|
|