[USACO5.1]圈奶牛Fencing the Cows —— 二维凸包

题目描述

传送门

解析

$Graham$算法
PS：现已退役，就随便写写。
知识点：平面向量叉乘（顺时针旋转值为负，逆时针为正），单调栈维护
注意：按$(x,y)$排序；第一个点，最有一个点必定在凸包上；以第一个点与最后一个点为界限，分两半分别求解

PS：貌似按极角排序的话，可以只扫一遍的样纸

代码

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>

#define IL inline

using namespace std; 

IL int read()
{
	int sum = 0;
	bool f = 0;
	char c = getchar();
	for(; '0' > c || c > '9'; c = getchar())
	if(c == '-') f = 1;
	for(; '0' <= c && c <= '9'; c = getchar())
		sum = sum * 10 + (c - '0');
	return f ? -sum : sum;
}

struct Point
{
	double x, y;
	IL Point(double x_ = 0, double y_ = 0) { x = x_; y = y_; }
	
	IL bool operator < (const Point &b) const
	{
		if(x == b.x) return y < b.y;
		return x < b.x;
	}	
};

Point num[10005];
int stk[10005], size;

IL double mul(int p1, int p2, int p3)
{
	return (num[p2].x - num[p1].x) * (num[p3].y - num[p2].y) - (num[p2].y - num[p1].y) * (num[p3].x - num[p2].x);
}

IL double dis(int p1, int p2)
{
	return sqrt((num[p1].x - num[p2].x) * (num[p1].x - num[p2].x) + (num[p1].y - num[p2].y) * (num[p1].y - num[p2].y));
}

int main()
{
	
	int n = read();
	for(int i = 1; i <= n; ++i)
		scanf("%lf %lf", &num[i].x, &num[i].y);
	sort(num + 1, num + n + 1);
	
	stk[++size] = 1; stk[++size] = 2;
	
	double ans = 0;
	
	for(int i = 3; i <= n; ++i)
	{
		for(; size > 1 && (mul(stk[size - 1], stk[size], i) <= 0);) --size;
		stk[++size] = i;
	}
		
	for(int i = 2; i <= size; ++i)
		ans += dis(stk[i], stk[i - 1]);
	
	size = 0;
	
	stk[++size] = 1; stk[++size] = 2;
	
	for(int i = 3; i <= n; ++i)
	{
		for(; size > 1 && (mul(stk[size - 1], stk[size], i) >= 0);) --size;
		stk[++size] = i;
	}
	
	for(int i = 2; i <= size; ++i)
		ans += dis(stk[i], stk[i - 1]);	
		
	printf("%.2lf\n", ans);
	
	return 0;
}