POJ - 2187 Beauty Contest 凸包+旋转卡壳

题目链接：https://cn.vjudge.net/problem/POJ-2187

题意：n个点，求距离最远的两个点的距离的平方

题解：先求出凸包上的点，然后旋转卡壳算法扫一遍即可，这个题直接暴力枚举凸包上的点也可以过

旋转卡壳算法：http://www.cnblogs.com/xdruid/archive/2012/07/01/2572303.html

应用：https://blog.csdn.net/hanchengxi/article/details/8639476

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define eps 1e-8
struct Point{
	int x, y;
	Point (int x_=0,int y_=0)
	{
		x=x_;y=y_;
	}
	Point operator + (const Point &xx)const 
	{
		return Point(x+xx.x,y+xx.y);
	}
	Point operator - (const Point &xx)const 
	{
		return Point(x-xx.x,y-xx.y);
	}
	
	
}a[50010],b[50010];
int cross(Point xx,Point yy)
{
	return (xx.x*yy.y-xx.y*yy.x);
}
double dis(Point xx,Point yy)
{
	return sqrt(1.0*(xx.x-yy.x)*(xx.x-yy.x) + (xx.y-yy.y)*(xx.y-yy.y));
}
int dist(Point xx,Point yy)
{
	return (xx.x-yy.x)*(xx.x-yy.x) + (xx.y-yy.y)*(xx.y-yy.y);
}
int n,m;
bool cmp(Point xx,Point yy)
{
	int O=cross(xx-a[1],yy-a[1]);
	if(O>0 || O==0&&dis(a[1],xx)<dis(a[1],yy)) return 1;
	else return 0;
}
void solve()
{
	for(int i=1;i<=min(2,n);i++)
		b[m++]=a[i];
	for(int i=3;i<=n;i++)
	{
		while(m>1 && cross(b[m-1]-b[m-2],a[i]-b[m-2])<=0)m--;
		b[m++]=a[i];
	}
	int ans=0;
	int p=1;
	for(int i=0;i<m;i++)
	{
		while(cross(b[(i+1)%m]-b[i],b[(p+1)%m]-b[i])>cross(b[(i+1)%m]-b[i],b[(p)%m]-b[i])) p++;
		ans=max(ans,max(dist(b[i],b[p%m]),dist(b[(i+1)%m],b[p%m])));
	}
	printf("%d\n",ans);
}
int main()
{
	while(~scanf("%d",&n))
	{
		int k=1;
		m=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d%d",&a[i].x,&a[i].y);
			if(a[i].y<a[k].y|| (a[i].y==a[k].y&&a[i].x<a[k].x))
			{
				k=i;
			}
		}
		if(n==1)
		{
			printf("0\n");
			continue;
		}
		swap(a[1].x,a[k].x);swap(a[1].y,a[k].y);
		sort(a+2,a+1+n,cmp);
		solve();
	}
	return 0;
}