HDUOJ 1392 Surround the Trees（凸包）

题意：给出很多点、将其圈成一个凸多边形、问周长最少几何
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1392
solution：graham算法

#include <bits/stdc++.h>
using namespace std;
#define eps 1e-8

struct point{
	double x, y;
	point() = default;
	point(double a, double b):x(a), y(b){}
	point operator - (point a){
		return point(x - a.x, y - a.y);
	}
	point operator + (point a){
		return point(x + a.x, y + a.y);
	}
	double operator * (point a){
		return x * a.y - y * a.x;
	}
	//按斜率先排序
	bool operator < (const point a)const {
		if (fabs(x - a.x) < eps)return y < a.y;
		return x < a.x;
	}
	//向量的模
	double len(){
		return sqrt(x * x + y * y);
	}
}arr[105], sta[105];

//求叉乘
double cp(point a, point b, point o){
	return (a - o) * (b - o);
}

//利用graham算法求凸包
void graham(point *p, int &n)
{
	sort(arr, arr + n);
	int top, m;
	sta[0] = arr[0];
	sta[1] = arr[1];
	top = 1;
	//从前往后扫
	for (int i = 2; i < n; ++i){
		while (top > 0 && cp(arr[i], sta[top], sta[top - 1]) >= 0)--top;
		sta[++top] = arr[i];
	}
	m = top;
	sta[++top] = arr[n - 2];
	//从后往前扫
	for (int i = n - 3; i >= 0; --i){
		while (top > m && cp(arr[i], sta[top], sta[top - 1]) >= 0)--top;
		sta[++top] = arr[i];
	}
	n = top;
}

int main()
{
	int n;
	while (cin >> n){
		if (!n)return 0;
		for (int i = 0; i < n; ++i)scanf("%lf%lf", &arr[i].x, &arr[i].y);
		sort(arr, arr + n);
		int cnt = 0;
		for (int i = 1; i < n; ++i){
			if (fabs(arr[i].x - arr[cnt].x) > eps || fabs(arr[i].y - arr[cnt].y) > eps)arr[++cnt] = arr[i];
		}
		++cnt;
		if (cnt == 1){
			printf("0.00\n");
			continue;
		}else if (cnt == 2){
			printf("%.2lf\n", (arr[1] - arr[0]).len());
			continue;
		}
		graham(arr, cnt);
		double ans = 0;
		sta[cnt] = sta[0];
		for (int i = 0; i < cnt; ++i)ans += (sta[i + 1] - sta[i]).len();
		printf("%.2lf\n", ans);
	}
}