Description: Problem Description: A oil company plans to build a main oil pipeline from east to west. The pipeline must pass through a n wells in oil fields. From each of wells must have an oil pipeline along the Shortest Path (or the South or North) and the director of Road connected. If for a given n the location of wells, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even though the well-to-head Road, the length of the pipeline between the sum of the minimum position? programming tasks: Given the location of wells n, programming calculate their well-to-head Road, the minimum length of the pipeline between the sum of.
- [pipe] - An oil company plans to construct a east
- [oil_pipe] - guandaowenti
File list (Check if you may need any files):
shuyouguandao.doc