E - Cows【凸包】

Your friend to the south is interested in building fences and turning plowshares into swords. In order to help with his overseas adventure, they are forced to save money on buying fence posts by using trees as fence posts wherever possible. Given the locations of some trees, you are to help farmers try to create the largest pasture that is possible. Not all the trees will need to be used.

However, because you will oversee the construction of the pasture yourself, all the farmers want to know is how many cows they can put in the pasture. It is well known that a cow needs at least 50 square metres of pasture to survive.

Input

The first line of input contains a single integer, n (1 ≤ n ≤ 10000), containing the number of trees that grow on the available land. The next n lines contain the integer coordinates of each tree given as two integers x and y separated by one space (where -1000 ≤ x, y ≤ 1000). The integer coordinates correlate exactly to distance in metres (e.g., the distance between coordinate (10; 11) and (11; 11) is one metre).

Output

You are to output a single integer value, the number of cows that can survive on the largest field you can construct using the available trees.

Sample Input

4
0 0
0 101
75 0
75 101

Sample Output

151

思路：先求凸包然后求面积。

code:

#include<iostream>
#include<cmath>
#include<algorithm>
#define MAX 100000
using namespace std;
typedef long long ll;
int top;
struct node{
	int x,y;
}d[MAX],s[MAX];
bool cmp1(node a,node b){
	if(a.x==b.x){
		return a.y<b.y;
	}
	return a.x<b.x;
}
bool cmp(node a,node b)
{
       double A=atan2((a.y-d[0].y),(a.x-d[0].x));
       double B=atan2((b.y-d[0].y),(b.x-d[0].x));
       if(A!=B) return A<B;
       else return a.x<b.x;
}
ll cross(node a,node b,node c)
{
	return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);
}
void Convex_Hull()//求n个点凸包的算法
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	cin>>d[i].x>>d[i].y;
	sort(d,d+n,cmp1);
	s[0]=d[0];//找到最左下方的点，放进s
	sort(d+1,d+n,cmp);//按照倾角排从小到大，若相同按照距离排近的优先
	s[1]=d[1];//第一个点放进s
	top=1;//记录s的大小
	for(int i=2;i<n;){
		if(top && cross(s[top-1],d[i],s[top])>=0){//不满足条件，出s，理解见后面的图
			top--;
		}
		else{
			s[++top]=d[i++];
		}
	}
}
int main()
{
	Convex_Hull();
	int sum=0;
	for(int i=1;i<top;i++)
	{
		sum+=((s[i+1].x-s[0].x)*(s[i].y-s[0].y)-(s[i].x-s[0].x)*(s[i+1].y-s[0].y));
	}
	cout<<int(fabs(sum/2.0)/50)<<endl;
	return 0;
}