acm材料!.docVIP

凸包 #includeiostream #includecmath using namespace std; int N; typedef struct { double x; double y; }Point; Point p[110], stack[110]; int top; double Mul(Point p1, Point p2, Point p3) //最基本的凸包模板 { return (p2.x - p1.x) * (p3.y - p1.y) - (p2.y - p1.y) * (p3.x - p1.x); } double dis(Point a, Point b) { return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); } int cmp(const void *a, const void *b) { Point c = *(Point *)a; Point d = *(Point *)b; double k = Mul(p[0], c, d); if(k 0 || (!k dis(c, p[0]) dis(d, p[0]))) return 1; return -1; } void Convex() { for(int i = 1; i N; i++) { Point temp; if(p[i].y p[0].y || (p[i].y == p[0].y p[i].x p[0].x)) { temp = p[i]; p[i] = p[0]; p[0] = temp; } } qsort(p + 1, N - 1, sizeof(p[0]), cmp); stack[0] = p[0]; stack[1] = p[1]; stack[2] = p[2]; top =2; for(int i = 3; i N; i++) { while(top = 2 Mul(stack[top - 1], stack[top], p[i]) = 0) top--; top++; stack[top] = p[i]; } } int main() { while(cin N, N){ for(int i = 0; i N; i++) { cin p[i].x p[i].y; } cout.setf(ios::fixed); cout.precision(2); if(N == 1) { cout 0.00 endl; continue; } else if(N == 2) { cout dis(p[0], p[1]) endl; continue; } Convex(); double ans = 0; for(int i = 0; i top; i++) ans += dis(stack[i],stack[i + 1]); ans += dis(stack[top], stack[0]); cout ans endl; } return 0; } 素数的筛法 #includecstdio #i