Description: Problem Description: A plan to build a oil from east to west of the main pipeline. The pipeline to pass through a field of n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the director of Road. If given the location of oil wells n, that is, their x coordinates (east-west) and y coordinates (north-south), head of Road should be how to determine the optimal position, even if the well-to-head Road, the pipeline length between the sum of the smallest location? programming tasks: to set the location of oil wells n, programming the calculation of the well-to-head Road, the pipeline between the sum of the minimum length.
To Search:
- [guandao.cpp] - An oil company plans to construct a east
File list (Check if you may need any files):
2.txt