POJ 2187 Beauty Contest （凸包）

 

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) 

 

 

 

题目要求的是两点之间的最远距离，刚开始想暴力枚举出来所有点之间的距离，但是发现会超时，后来发现，两点之间距离较大的点都在凸包上面，即为凸包的顶点。关于求凸包最常用的的方法就是graham scan 法，大体思想为：先找出坐标系中最左下角的坐标，即先取最小的y坐标，当y坐标有相等的时候，比较x坐标，取较小的。

而后利用叉积公式进行比较，如果栈顶元素和次栈顶元素以及即将入栈的元素的叉积小于0，设top为栈顶元素，（p[top] - p[top - 1]）* （p[i] - p[top - 1]），若叉积大于0，说明p[ top]的极角小于p[i]的极角，即p[top]比p[i]先被扫描，也就是连线的方向是左转。所以当没回到出发点时即top>0 且 叉积小于0时，让栈顶元素出栈，否则入栈。当求出凸包后，直接枚举出所有凸包上顶点的距离，输出最大的即可。

 

 

 

#include <stdio.h>
#include <cmath>
#include<cstring>
#include <algorithm>
#define N 50005
using namespace std;

struct point{
	int x,y;
}p[N];
int n,s[N],top;

int cross(point a, point b, point c){ //求叉积 
	return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
}

int dis(point a, point b){ //求距离 
	return (b.x - a.x) * (b.x - a.x) + (b.y - a.y) * (b.y - a.y);
}

bool cmp(point a, point b){ //进行排序，判断扫描的先后顺序 
	int ans = cross(p[0],a,b);
	//极角是指该线段与x轴所形成的夹角，因为是逆时针扫描，夹角小的会先被扫描 
	if(ans > 0 || (!ans && dis(p[0],a) > dis(p[0],b) ))//a先于b被扫描，即当ans>0时 ，a的极角小于b的极角 ，夹角相同取距离长的。 
		return true;
	return false;
}

void Graham(){ //求凸包 
	top = 1;	s[0] = 0;	s[1] = 1;//用top来计算凸包共有多少顶点 
	
	for(int i = 2; i < n; i ++){
		while(top && cross(p[s[top - 1]],p[s[top]],p[i]) < 0) //top>0表示没有回到出发点，叉积小于0表示连线右转 
			top --; //当连线右转时，栈顶元素出栈 
		s[++ top] = i;
	}
	top ++; //也可不加此句 
}

void RC(){ //求最长的距离 
	int ans = 0;
	
	for(int i = 0; i < top; i ++){
		for(int j = i + 1; j <= top; j ++){
			int tmp = dis(p[s[i]],p[s[j]]);
			if(ans < tmp)
				ans = tmp;
		}	
	}
	printf("%d\n",ans);
}

int main(){
	
	while(~scanf("%d",&n)){
		for(int i = 0; i < n; i ++)
			scanf("%d%d",&p[i].x,&p[i].y);
			
		int u = 0;
		for(int i = 1; i < n; i ++){
			if(p[u].y > p[i].y || (p[u].y == p[i].y && p[u].x > p[i].x)) //查找左下角的坐标点 
				u = i;
		}
		
		if(u){
			swap(p[u].y,p[0].y);	swap(p[u].x,p[0].x);
		}
		
		sort(p + 1, p + n, cmp);
		
		Graham();
		
		RC();
	}
	
	return 0;
}