Toy Storage POJ - 2398 向量叉積加排序

對線段排完序直接二分ios 對叉積的解釋以後會貼上鍊接spa #include<cstring> #include<algorithm> #include<cstdio> #include<iostream> using namespace std; struct point { int x,y; point(){ } point(int a,int b) { x=a,y=b;

>>阅读原文<<