poj3348 Cows【凸包模板】

解题思路：

求出凸包后用面积除以50即为答案。

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

int getint()
{
    int i=0,f=1;char c;
    for(c=getchar();(c!='-')&&(c<'0'||c>'9');c=getchar());
    if(c=='-')c=getchar(),f=-1;
    for(;c>='0'&&c<='9';c=getchar())i=(i<<3)+(i<<1)+c-'0';
    return i*f;
}

const int N=10005;
struct point
{
    int x,y;
    point(){}
    point(int _x,int _y):
        x(_x),y(_y){}
    inline friend point operator - (const point &a,const point &b)
    {
        return point(a.x-b.x,a.y-b.y);
    }
    inline friend int operator * (const point &a,const point &b)
    {
        return a.x*b.y-a.y*b.x;
    }
    inline int dis()
    {
        return x*x+y*y;
    }
}p[N],sta[N];
int n,m,ans;

inline bool cmp(const point &a,const point &b)
{
    int det=(a-p[1])*(b-p[1]);
    if(det)return det>0;
    return (a-p[1]).dis()<(b-p[1]).dis();
}

void graham()
{
    int id=1;
    for(int i=2;i<=n;i++)
        if(p[i].x<p[id].x||p[i].x==p[id].x&&p[i].y<p[id].y)id=i;
    if(id!=1)swap(p[1],p[id]);
    sort(p+2,p+n+1,cmp);
    sta[++m]=p[1];
    for(int i=2;i<=n;i++)
    {
        while(m>2&&(sta[m]-sta[m-1])*(p[i]-sta[m])<0)m--;
        sta[++m]=p[i];
    }
}

int main()
{
    //freopen("lx.in","r",stdin);
    n=getint();
    for(int i=1;i<=n;i++)
        p[i].x=getint(),p[i].y=getint();
    graham();
    for(int i=2;i<m;i++)
        ans+=(sta[i]-sta[1])*(sta[i+1]-sta[1]);
    cout<<ans/100;
    return 0;
}