WA
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int SIZE = 100005;
typedef struct {
double x;
double y;
}point;
point p[SIZE], c[SIZE]/*用作辅助数组*/;
double getDistance(point &a, point &b){ /*求得两点之间的距离*/
return sqrt(pow(a.x - b.x, 2.0) + pow(a.y - b.y, 2.0));
}
bool cmpx(point &a, point &b){
if (a.x == b.x)
return a.y < b.y;
return a.x < b.x;
}
bool cmpy(point &a, point &b){
if (a.y == b.y)
return a.x < b.x;
return a.y < b.y;
}
inline double min(double a, double b, double c){
a = a< b ? a : b;
a = a< c ? a : c;
return a;
}
inline double minDist(double a, double b){
a=a<b?a:b;
return a;
}
double divide_conquer(i