文件名称:posthost
- 所属分类：
- JSP源码/Java
- 资源属性：
- [Java] [源码]
- 上传时间：
- 2016-04-04
- 文件大小：
- 110kb
- 下载次数：
- 0次
- 提 供 者：
- liba*****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
邮局选址
问题描述：在一个按照东西和南北方向划分成规整街区的城市里，n个居民点散乱地分布在不同的街区中。用x坐标表示东西向，用y坐标表示南北向。各居民点的位置可以由坐标(x,y)表示。要求：为建邮局选址，使得n个居民点到邮局之距离的总和最小。
提示：带权中位数（分治算法）
-Post office location problem descr iption: 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)
问题描述：在一个按照东西和南北方向划分成规整街区的城市里，n个居民点散乱地分布在不同的街区中。用x坐标表示东西向，用y坐标表示南北向。各居民点的位置可以由坐标(x,y)表示。要求：为建邮局选址，使得n个居民点到邮局之距离的总和最小。
提示：带权中位数（分治算法）
-Post office location problem descr iption: 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