最远点对 白书模板

#include<bits/stdc++.h>

using namespace std;

#define sqr(x) ((x)*(x))

const int maxn = 50005;

const double EPS = 1e-10;

double add(double a, double b)
{
	if (abs(a + b)<EPS*(abs(a) + abs(b)))
		return 0;
	return a + b;
}

struct P {
	double x, y;
	P() {}
	P(double x, double y) :x(x), y(y) {}
	P operator + (P p)
	{
		return P(add(x, p.x), add(y, p.y));
	}
	P operator - (P p)
	{
		return P(add(x, -p.x), add(y, -p.y));
	}
	P operator * (double d)
	{
		return P(x*d, y*d);
	}
	double dot(P p)
	{
		return add(x*p.x, y*p.y);
	}
	double det(P p)
	{
		return add(x*p.y, -y*p.x);
	}
	double norm() {
		return sqrt(sqr(x) + sqr(y));
	}
};

bool cmp_x(const P& p, const P& q)
{
	if (p.x != q.x) return p.x<q.x;
	else return p.y<q.y;

}

vector<P> convex_hull(P* ps, int n)
{
	sort(ps, ps + n, cmp_x);
	int k = 0;
	vector<P> qs(n * 2);
	for (int i = 0;i<n;i++)
	{
		while (k>1 && (qs[k - 1] - qs[k - 2]).det(ps[i] - qs[k - 1]) <= 0)
			k--;
		qs[k++] = ps[i];
	}
	for (int i = n - 2, t = k;i >= 0;i--)
	{
		while (k>t && (qs[k - 1] - qs[k - 2]).det(ps[i] - qs[k - 1]) <= 0)
			k--;
		qs[k++] = ps[i];
	}
	qs.resize(k - 1);
	return qs;
}

double dist(P p, P q)
{
	return (p-q).dot(p-q);
}

int N,L;
double C;
P ps[maxn];

void solve() {
	vector<P> qs = convex_hull(ps, N);
	qs.push_back(*qs.begin()), qs.push_back(*(qs.begin() + 1));
	for (vector<P>::iterator it = qs.begin();it != qs.end() - 2;it++) {
		P p1 = *it, p2 = *(it + 1), p3 = *(it + 2);
		C += (p1 - p2).norm();
	}
	int ans = round(C+acos(-1)*2.0*L);
	printf("%d\n", ans);
}


int main()
{
	int i;
	while (cin >> N>>L)
	{
		C = 0;
		for (i = 0;i<N;i++)
		{
			scanf("%lf%lf", &ps[i].x, &ps[i].y);
		}
		solve();
	}
	return 0;
}