POJ：2187 Beauty Contest 旋转卡壳

Beauty Contest

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 39341		Accepted: 12207

Description

Bessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the title 'Miss Cow World'. As a result, Bessie will make a tour of N (2 <= N <= 50,000) farms around the world in order to spread goodwill between farmers and their cows. For simplicity, the world will be represented as a two-dimensional plane, where each farm is located at a pair of integer coordinates (x,y), each having a value in the range -10,000 ... 10,000. No two farms share the same pair of coordinates. 

Even though Bessie travels directly in a straight line between pairs of farms, the distance between some farms can be quite large, so she wants to bring a suitcase full of hay with her so she has enough food to eat on each leg of her journey. Since Bessie refills her suitcase at every farm she visits, she wants to determine the maximum possible distance she might need to travel so she knows the size of suitcase she must bring.Help Bessie by computing the maximum distance among all pairs of farms. 

Input

* Line 1: A single integer, N 

* Lines 2..N+1: Two space-separated integers x and y specifying coordinate of each farm 

Output

* Line 1: A single integer that is the squared distance between the pair of farms that are farthest apart from each other. 

Sample Input

4
0 0
0 1
1 1
1 0

Sample Output

2

Hint

Farm 1 (0, 0) and farm 3 (1, 1) have the longest distance (square root of 2) 

求凸包直径

旋转卡壳直接上

#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<map>
#include<set>
using namespace std;

typedef long long ll;

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void print(int x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}

const int N=50100;

int root=1;

struct node
{
	int x,y;
	friend int cross(const node &x,const node &y,const node &bas)
	{
		int x1=x.x-bas.x,x2=y.x-bas.x;
		int y1=x.y-bas.y,y2=y.y-bas.y;
		return x1*y2-x2*y1;
	}
	friend int dis(const node &x,const node &y)
	{return (x.x-y.x)*(x.x-y.x)+(x.y-y.y)*(x.y-y.y);}
}p[N];

inline bool cmp(const node &x,const node &y)
{
	int tmp=cross(x,y,p[1]);
	return tmp==0 ? dis(x,p[1])<dis(y,p[1]) : tmp<0;
}

int n;
int st[N],top;

void graham()
{
	n=read();
	register int i;
	for(i=1;i<=n;++i)
	{
		p[i].x=read();p[i].y=read();
		if( p[i].x<p[root].x || (p[i].x==p[root].x&&p[i].y<p[root].y) )
			root=i;
	}
	swap(p[root],p[1]);
	sort(p+2,p+1+n,cmp);
	top=2;
	st[1]=1;st[2]=2;
	for(i=3;i<=n;++i)
	{
		while(top>1&&cross(p[st[top]],p[i],p[st[top-1]])>=0)top--;
		st[++top]=i;
	}
	st[++top]=1;
}

int ans=0;

void RC()
{
	register int i,now=2;
	for(i=1;i<top;++i)
	{
		while(cross(p[st[now+1]],p[st[i+1]],p[st[i]])>cross(p[st[now]],p[st[i+1]],p[st[i]]))
		{
			now++;
			if(now==top)now=1;
		}
		ans=max(ans,dis(p[st[now]],p[st[i]]));
	}
}

int main()
{	
	graham();RC();
	cout<<ans<<endl;
	return 0;
}
/*
4
0 0
0 1
1 1
1 0

2
*/