[luogu2742]凸包模板

//凸包板子
#include <bits/stdc++.h>
using namespace std;
#define N 10010
const double eps = 1e-10;
int dcmp(double x)
{
	if (fabs(x) < eps) return 0;
	else return x < 0 ? -1 : 1;
}
struct point
{
	double x,y;
	point(double x = 0, double y = 0):x(x), y(y){}
}p[N], ch[N]; 
typedef point Vector;
Vector operator - (point a, point b)
{
	return Vector(a.x - b.x, a.y - b.y);
}
bool operator < (const point & a, const point & b){
	return a.x < b.x || a.x == b.x && a.y < b.y;
}
bool operator == (const point & a, const point & b){
	return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0;
}
double sqr(double x){return x * x;}
double Cross(Vector A, Vector B){return A.x * B.y - A.y * B.x;}
double dis(point a, point b){return sqrt(sqr(a.x - b.x) + sqr(a.y - b.y));}
int n, m;
double ans;
bool flag[N];
int ConvexHull()
{
	sort(p+1,p+n+1);
	memset(flag, 0, sizeof(flag));
	for (int i=2;i<=n;i++)
		if (p[i] == p[i-1]) flag[i] = 1;
	m = 0;
	for (int i=1;i<=n;i++)
	{
		if (flag[i]) continue;
		while (m > 1 && Cross(ch[m-1] - ch[m-2], p[i] - ch[m-2]) <= 0) m--;
		ch[m++] = p[i];
	}
	int k = m;
	for (int i = n-1;i>=1;i--)
	{
		if (flag[i]) continue;
		while (m > k && Cross(ch[m-1] - ch[m-2], p[i] - ch[m-2]) <= 0) m--;
		ch[m++] = p[i];
	}
	if (n > 2) m--;
	return m;
}
int main()
{
	scanf("%d", &n);
	for (int i=1;i<=n;i++)
		scanf("%lf%lf", &p[i].x, &p[i].y);
	ConvexHull();
	ans = 0;
	for (int i=0;i<m;i++)
		ans += dis(ch[i], ch[i+1]);
	printf("%.2f\n", ans);
}