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)

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

• 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．