#include
#include
#include?
#define?TRUE?1
#define?FALSE?0
using?namespace?std;
typedef?struct?Node//坐標(biāo)點(diǎn)
{
????double?x;
????double?y;
}Node;
typedef?struct?List
{
????Node*?data;??????//點(diǎn)
????int?count;??????//點(diǎn)的個(gè)數(shù)
}List;
typedef?struct?CloseNode
{
????Node?a;
????Node?b;?????//計(jì)算距離的兩個(gè)點(diǎn)
????double?space;?????//距離平方
}CloseNode;
????int?n;?????//點(diǎn)的數(shù)目
//輸入各點(diǎn)到List中
void?create（List?&L）
{
????cin?>>?n;
????L.count?=?n;
????L.data?=?new?Node[L.count];??????//動(dòng)態(tài)空間分配
????for?（int?i?=?0;?i????cin?>>?L.data[i].x?>>?L.data[i].y;
}
//求距離的平方
double?square（Node?a?Node?b）
{
????return?（（a.x?-?b.x）*（a.x?-?b.x））?+?（（a.y?-?b.y）*（a.y?-?b.y））;
}
//冒泡排序
void?BubbleSort（Node?r[]?int?length）
{
????int?change?n;
????n?=?length;?change?=?TRUE;
????double?b?c;
????for?（int?i?=?0;?i????{
????????change?=?FALSE;
????????for?（int?j?=?0;?j????????????{
????????????????if?（r[j].x>r[j?+?1].x）
????????????????{
?????????????????????b?=?r[j].x;?c?=?r[j].y;
?????????????????????r[j].x?=?r[j?+?1].x;?r[j].y?=?r[j?+?1].y;
?????????????????????r[j?+?1].x?=?b;?r[j?+?1].y?=?c;
?????????????????????change?=?TRUE;
????????????????}
????????????}
????}
}
//分治法中先將坐標(biāo)按X軸從小到大的順序排列
void?paixu（List?L）
{
????BubbleSort（L.data?L.count）;???//調(diào)用冒泡排序
}
//左右各距中線d的區(qū)域的最近對(duì)算法
void?middle（const?List?&?L?CloseNode?&cnode?int?