文件名称:devide_conquer
介绍说明－－下载内容均来自于网络，请自行研究使用
分治法解最近点对问题：首先输入点的个数，然后输入点的坐标，输出先是根据x的坐标对点进行排序，然后输出最近点对的距离。-Divide and conquer solution of the nearest point of the problem: First, the number of input points, and then enter the coordinates of points, the output first, according to the coordinates of the points x sort, and then output the nearest point of the distance.
相关搜索： devide_conquer
(系统自动生成,下载前可以参看下载内容)
下载文件列表
devide_conquer
..............\zuijingdiandui2.cpp
..............\zuijingdiandui2.exe
..............\分治法解最近点对问题.txt
..............\zuijingdiandui2.cpp
..............\zuijingdiandui2.exe
..............\分治法解最近点对问题.txt