POJ 2455 - Secret Milking Machine
Problem : Find T different path and make the longest edge minimum.
Solution : Using dichotomy to find the minimum edge, and erase the edge longer than it, and then SAP.