An oil pipeline plans to build a problem from east to west from the main pipeline. The pipeline to pass through a field of n wells. From each of the wells must have a pipeline along the shortest path (or south or north) is connected with the main channel. If a given n the location of wells, that is, their x coordinates (east-west) and y coordinates (north-south), how to determine the optimal location of the main channel, even if the oil pipeline to the main road between the sum of the minimum length position? programming tasks: Given n the location of wells, each well programmed to calculate the main channel between the sum of the minimum length of the pipeline.

shuyouguandao.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．