极角排序+凸包

#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

int n;
const int MAXN = 1e5 + 5;

struct Point {
    double x, y;
} p[MAXN], Stack[MAXN];

int Top = 0;

bool cmp1(Point u, Point v) {
    if (u.y == v.y)return u.x < v.x;
    else return u.y > v.y;
}

bool cmp2(Point u, Point v) {
    return atan2(u.y - p[0].y, u.x - p[0].x) < atan2(v.y - p[0].y, v.x - p[0].x);
}

bool Check(Point o, Point u, Point v) {
    Point a = {u.x - o.x, u.y - o.y};
    Point b = {v.x - o.x, v.y - o.y};
    return a.x * b.y - b.x * a.y < 0;
}

signed main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)scanf("%lf %lf", &p[i].x, &p[i].y);
    if (n == 1) {
        printf("0.00\n");
        return 0;
    }
    if (n == 2) {
        double ans = sqrt((p[1].x - p[2].x) * (p[1].x - p[2].x) +
                          (p[1].y - p[2].y) * (p[1].y - p[2].y));
        printf("%.2lf\n", ans);
        return 0;
    }
    sort(p + 1, p + 1 + n, cmp1);
    p[0] = p[n];
    n--;
    sort(p + 1, p + 1 + n, cmp2);
    Stack[++Top] = p[0];
    for (int i = 1; i <= n; i++) {
        while (Top >= 2) {
            if (Check(Stack[Top], Stack[Top - 1], p[i]))break;
            else Top--;
        }
        Stack[++Top] = p[i];
    }
    while (Top >= 3) {
        if (Check(Stack[Top], Stack[Top - 1], p[0]))break;
        else Top--;
    }
    double ans = 0;
    for (int i = 1; i <= Top - 1; i++) {
        ans += sqrt((Stack[i].x - Stack[i + 1].x) * (Stack[i].x - Stack[i + 1].x) +
                    (Stack[i].y - Stack[i + 1].y) * (Stack[i].y - Stack[i + 1].y));
    }
    ans += sqrt((Stack[1].x - Stack[Top].x) * (Stack[1].x - Stack[Top].x) +
                (Stack[1].y - Stack[Top].y) * (Stack[1].y - Stack[Top].y));
    printf("%.2lf\n", ans);
    return 0;
}