超级码力

#include #include #include using namespace std; struct Point { double x,y,len; }Pt[20000],Stack[20000],Point_A; double Cross(Point a,Point b,Point c) { return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.

hrbust 1421最远点对旋转卡壳 LOLI们想知道最大的距离的平方和是多少 #include #include #include using namespace std; struct Point { long long x,y,len; }Pt[30005],Stack[30005],Point_A; long long Cross(Point a,Point b,Point c