BryantMark

#include #include #include #include #include using namespace std; const int maxn = 305; const double eps = 1e-6; #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 struct Point { double x, y, z;

根据线段相交 建图  求最短路 二分答案 求最小路径覆盖 #include #include #include const int maxn = 311; const double eps = 1e-8; const double INF = 1e50; #define zero(x) (((x)>0?(x):-(x))<eps) template T min(const T& a, co