poj3348凸包面积

用叉积求凸包面积

如图所示，每次找p【0】来计算，（叉积是以两个向量构成的平行四边形的面积，所以要/2）

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cassert>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pi acos(-1.0)
#define ll long long
#define mod 1000000007
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#pragma comment(linker, "/STACK:1024000000,1024000000")
 
using namespace std;
 
const double g=10.0,eps=1e-;
const int N=+,maxn=+,inf=0x3f3f3f;
 
struct point {
    double x,y;
};
point p[N],s[N];
int n;
double dir(point p1,point p2,point p3)
{
    return (p3.x-p1.x)*(p2.y-p1.y)-(p3.y-p1.y)*(p2.x-p1.x);
}
double dis(point p1,point p2)
{
    return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
bool comp(point p1,point p2)
{
    double te=dir(p[],p1,p2);
    if(te<)return ;
    if(te==&&dis(p[],p1)<dis(p[],p2))return ;
    return ;
}
double Graham()
{
    int pos;
    double minx,miny;
    minx=miny=inf;
    for(int i=;i<n;i++)
    {
        if(p[i].x<minx||(p[i].x==minx&&p[i].y<miny))
        {
            minx=p[i].x;
            miny=p[i].y;
            pos=i;
        }
    }
    swap(p[],p[pos]);
    sort(p+,p+n,comp);
    int top=;
    p[n]=p[];
    s[]=p[],s[]=p[],s[]=p[];
    for(int i=;i<=n;i++)
    {
        while(top>=&&dir(s[top-],s[top],p[i])>=)top--;
        s[++top]=p[i];
    }
    double ans=;
    for(int i=;i<top-;i++)
        ans-=dir(s[],s[i],s[i+]);
    return ans/;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie();
    while(cin>>n){
        for(int i=;i<n;i++)
            cin>>p[i].x>>p[i].y;
        cout<<(int)Graham()/<<endl;
    }
    return ;
}