完成一维的最接近点对问题，用的是分治算法进行的-The closest point to complete one-dimensional problem, using a partition algorithm of

集合划分问题。给定正整数 n，计算出n 个元素的集合{1,2, , n }可以划分为多少个不同的非空子集。-Set partitioning problem. Given a positive integer n, calculate the n elements of the set {1,2,  , n} can be divided into a number of different non-empty sets.