stack s; cin>>n; for(i = 0; i >pot[i].x>>pot[i].y; x = pot[0].x; y = pot[0].y; p = 0; for(i = 1; i < n; i++) //寻找最左上的点 { if(pot[i].y < y || (pot[i].y == y && pot[i].x < x)) { x = pot[i].x; y = pot[i].y; p = i; } } p0.x = x; p
I#region Structures public struct Segment { public PointF p; public PointF q; public bool contains(SuperPoint point) { if (p.Equals(point.P) || q.Equals(point.P)) return true; return false; } } public struct SuperPoint { public PointF P; public int
