摘要：
http://acm.timus.ru/problem.aspx?space=1&num=1246 1 #include 2 #include 3 #include 4 #define maxn 200010 5 using namespace std; 6 7 struct node 8 { 9 double x,y;10 }p[maxn];11 12 double cross(node a,node b,node c)13 {14 return (c.x-a.x)*(b.y-a.y)-(c.y-a.y)*(b.x-a.x);15 }16 17 int main()1... 阅读全文
