Description: An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) Road, connected with the director. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), director Road should be how to determine the optimal location, even if the wells to the Road, director of the oil pipeline between the length of the sum of the smallest location?
(2) Algorithm Design
N given the location of oil wells, oil wells to calculate Road director of the oil pipeline between the sum of minimum length.
(3) data entry
Provide data from the document. Documents the first acts of a few oil wells n, 1 <= n <= 10000 next n lines are the location of wells, each row two integers x and y,-10000 <= x, y <= 10000.
To Search:
File list (Check if you may need any files):
oil_tube.txt
Download