输油管道问题解答(国外英文资料).docVIP

输油管道问题解答(国外英文资料) Pipeline problem solving (fuzhou university algorithm and data structure course group) 1 problem description An oil company plans to build a main pipeline from east to west. The pipe has to pass through one N Wells of oil Field. Each oil well must have a pipeline along the shortest path (or south or north Its connected to the main pipe. If a given N oil mouth The location of the well, thats what they are X-coordinate (east and west) and The y-coordinate (north-south), how to determine the optimal location of the main pipeline, Even if the total length of the pipeline between the oil Wells and the main pipeline is the smallest? Prove that the supervisor can be identified in linear time The optimal location of the tao. 2 experimental tasks: For a given A linear time algorithm is designed to calculate the oil pipeline between the Wells and the main pipelines The sum of the small lengths. 3 way Set the given The location of the n well is: (x0, y0), (x1, y1), (xn - 1, yn - 1). Because the distance in the plane satisfies the triangle inequality, the shortest distance from each oil well to the main oil pipeline is the well to the Lord The vertical distance of the oil pipeline. So we can say that the problem that were describing is the line y equals c on the plane, (n) () () () () () () () Min ii. (n) (1) (-) | yi. Y | y . y.E I = 0. set Y0, y1, the median of yn - 1 Median (y). By further observation, the median (y) is (n) (1) (-) | yi. Y, | is the optimal solution. This conclusion will be strictly demonstrated in the correctness analysis of the algorithm. y.E I = 0 4 algorithm Through the above analysis, the problem of the pipeline problem is the problem of the median problem. (1) the quicksort algorithm in the textbook QuickSort will N Wells After the y-coordinate, its easy to figure out digits The median (y) is easy to find The length of the n well to the main pipe is the total. The algorithm can be described as follows: Void pipeline () { QuickSort (y,