POJ3348：Cows——题解

http://poj.org/problem?id=3348

题目大意：用已给出的点围出面积最大的凸包，输出面积/50（向下取整）

——————————————————————————

第一道凸包？以及不知道第几次的奶牛题……

显然裸题，切了。

（那博文的意义何在？）

（呃……方便以后抄板子？）

#include<cmath>
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef double dl;
const int N=1e5+;
inline int read(){
    int X=,w=;char ch=;
    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();
    return w?-X:X;
}
struct Point{
    dl x,y;
    Point(dl x0=,dl y0=){x=x0,y=y0;}
};
 
dl dis(Point a,Point b){//求两点距离
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
 
typedef Point Vector;
Vector operator +(Point a,Point b){return Vector(a.x+b.x,a.y+b.y);}
Vector operator -(Point a,Point b){return Vector(a.x-b.x,a.y-b.y);}
Vector operator *(Point a,dl k){return Vector(a.x*k,a.y*k);}
Vector operator /(Point a,dl k){return Vector(a.x/k,a.y/k);}
 
dl Dot(Vector a,Vector b){//求点积
    return a.x*b.x+a.y*b.y;
}
dl Cross(Vector a,Vector b){//求叉积
    return a.x*b.y-b.x*a.y;
}
dl Cross(Point sp,Point ep,Point op){//得到sp-op和ep-op的叉积
    return (sp.x-op.x)*(ep.y-op.y)-(ep.x-op.x)*(sp.y-op.y);
}
 
Point p[N],q[N];
int n,k,m;
inline bool cmp(int u,int v){
    int det=Cross(p[u],p[v],p[]);
    if(det!=)return det>;
    return dis(p[],p[u])<dis(p[],p[v]);
}
void graham(){
    int id=;
    for(int i=;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!=)swap(p[],p[id]);
 
    static int per[N];
    for(int i=;i<=n;i++)per[i]=i;
    sort(per+,per+n+,cmp);
 
    q[++m]=p[];
    for(int i=;i<=n;i++){
        int j=per[i];
        while(m>=&&Cross(p[j],q[m],q[m-])>=)m--;
        q[++m]=p[j];
    }
    return;
}
inline int area(){
    int ans=;
    q[].x=;q[].y=;
    for(int i=;i<=m;i++)ans+=Cross(q[i],q[i%m+],q[]);
    return abs(ans)/;
}
int main(){
    n=read();
    for(int i=;i<=n;i++)p[i].x=read(),p[i].y=read();
    graham();
    int ans=area()/;
    printf("%d\n",ans);
    return ;
}