Description: Post office location problem description: a north-south direction and in accordance with what is divided into regular city blocks, n scattered settlements located in different neighborhoods. Showing something to coordinate with x, y coordinates used to represent the north and south. Positions of settlements can be represented by the coordinates (x, y). Requirements: In order to build the post office location, so that the n settlements the post office to the sum of the minimum. Tip: weighted median (divide and conquer algorithm)
To Search:
File list (Check if you may need any files):
posthost\input_00.dat
........\input_01.dat
........\input_02.dat
........\input_03.dat
........\input_04.dat
........\input_05.dat
........\input_06.dat
........\input_07.dat
........\input_08.dat
........\input_09.dat
........\input_10.dat
........\output.txt
........\postoffice.class
........\postoffice.java
posthost
Download