POJ3348_Cows(几何/凸包+多边形面积)

Cows

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 6333		Accepted: 2897

Description

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 yseparated 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

Source

解题报告

凸包就不多说了，模板。

多边形面积嘛，看成多个三角形的面积，用叉乘求面积。

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>

using namespace std;
struct point
{
    double x,y;
} p[10010],s[10010];
double 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 cmp(point a,point b)
{
    if(a.x!=b.x)
        return a.x<b.x;
    else return a.y<b.y;
}
int main()
{
    int n,i,j;
    while(cin>>n)
    {
        memset(p,0,sizeof(p));
        memset(s,0,sizeof(s));
        for(i=0; i<n; i++)
        {
            cin>>p[i].x>>p[i].y;
        }
        sort(p,p+n,cmp);
        int m=0;
        for(i=0; i<n; i++)
        {
            while(m>1&&cross(s[m-2],s[m-1],p[i])<=0)m--;
            s[m++]=p[i];
        }
        int k=m;
        for(i=n-2; i>=0; i--)
        {
            while(m>k&&cross(s[m-2],s[m-1],p[i])<=0)m--;
            s[m++]=p[i];
        }
        int aaa=0;
        for(i=1; i<m-1; i++)
        {
            aaa+=(int)(cross(s[0],s[i],s[i+1]));
        }
        printf("%d\n",aaa/2/50);
    }
    return 0;
}