poj 3348

赤裸裸的凸包！百度的模板，学习graham求凸包！

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;


struct point {
double x,y;
};
point data[10008]={};
int n,top,res[10008]={};


bool cmp(point a,point b) {
if(a.y == b.y) return a.x < b.x;
return a.y < b.y;
}
bool mult(point sp, point ep, point op) {
    return (sp.x-op.x)*(ep.y-op.y) >= (ep.x-op.x)*(sp.y-op.y);
}
void graham() {
top = 1;
sort(data,data+n,cmp);
for(int i = 0; i < 3; i++)
 res[i] = i;
for(int i = 2; i < n; i++) {
while(top && mult(data[i],data[res[top]],data[res[top-1]]))
 top--;
res[++top] = i;
}
int len = top;
res[++top] = n - 2;
for(int i = n - 3; i >= 0; i--) {
while(top != len && mult(data[i],data[res[top]],data[res[top-1]]))
 top--;
res[++top] = i;
}
}
double area() {
double sum = 0;
sum = data[res[0]].y * (data[res[top-1]].x-data[res[1]].x);
for(int i = 1; i < top; i++)
 sum += data[res[i]].y*(data[res[i-1]].x-data[res[(i+1)%top]].x);
return sum/2;
}
int main() {
scanf("%d",&n);
for(int i = 0; i < n; i++)
scanf("%lf%lf",&data[i].x,&data[i].y);
if(n < 3)
 printf("0\n");
else {
graham();
if(top < 3) {
printf("0\n");
return 0;
}
double ans = area();
printf("%d\n",int(ans/50));
}
return 0;
}