POJ 3348 Cows（二维凸包）

题目链接：https://cn.vjudge.net/problem/POJ-3348

题意：有一些数，坐标已知，要用这些树作为篱笆的顶点圈一块多边形的地养牛，每头牛占地大小50，问最多能养多少头牛。

题解：一个简单的二维凸包，简单介绍一下算法，它是扫描算法的变种，和原始的相比，更快，且数值稳定性更好，这个算法在排序后仅仅是从左到右和从右到左各扫描了一次，时间复杂度为。加上排序后时间复杂度也仅为。吐槽一下，POJ真是远古OJ呀，啥也不认识，与时代落伍了都。

代码：

#pragma GCC optimize(2)
//#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#define inf 0x3f3f3f3f
#define Pair pair<int,int>
#define int long long
#define fir first
#define sec second
/*namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
	//fread->read
	bool IOerror = 0;
	//inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
	inline char nc() {
		static char buf[BUF_SIZE], * p1 = buf + BUF_SIZE, * pend = buf + BUF_SIZE;
		if (p1 == pend) {
			p1 = buf; pend = buf + fread(buf, 1, BUF_SIZE, stdin);
			if (pend == p1) { IOerror = 1; return -1; }
		}
		return *p1++;
	}
	inline bool blank(char ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'; }
	template<class T> inline bool read(T& x) {
		bool sign = 0; char ch = nc(); x = 0;
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		if (ch == '-')sign = 1, ch = nc();
		for (; ch >= '0' && ch <= '9'; ch = nc())x = x * 10 + ch - '0';
		if (sign)x = -x;
		return true;
	}
	inline bool read(double& x) {
		bool sign = 0; char ch = nc(); x = 0;
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		if (ch == '-')sign = 1, ch = nc();
		for (; ch >= '0' && ch <= '9'; ch = nc())x = x * 10 + ch - '0';
		if (ch == '.') { double tmp = 1; ch = nc(); for (; ch >= '0' && ch <= '9'; ch = nc())tmp /= 10.0, x += tmp * (ch - '0'); }
		if (sign)x = -x; return true;
	}
	inline bool read(char* s) {
		char ch = nc();
		for (; blank(ch); ch = nc());
		if (IOerror)return false;
		for (; !blank(ch) && !IOerror; ch = nc())* s++ = ch;
		*s = 0;
		return true;
	}
	inline bool read(char& c) {
		for (c = nc(); blank(c); c = nc());
		if (IOerror) { c = -1; return false; }
		return true;
	}
	template<class T, class... U>bool read(T& h, U& ... t) { return read(h) && read(t...); }
#undef OUT_SIZE
#undef BUF_SIZE
};
using namespace fastIO;*/
using namespace std;

const int N = 1e5 + 5;
const double eps = 1e-10;
const double pi = acos(-1.0);
const int mod = 998244353;
/*---------------------------------------------------------------------------------------------------------------------------*/
struct Point{double x,y;Point(double x=0,double y=0):x(x),y(y){}};
typedef Point Vector;
Vector operator + (Vector A,Vector 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 * (Vector A,double p){return Vector(A.x*p,A.y*p);}
Vector operator / (Vector A,double p){return Vector(A.x/p,A.y/p);}
bool operator < (const Point& A,const Point& B){return A.x<B.x || (A.x==B.x&&A.y<B.y);}
int dcmp(double x){if(fabs(x)<eps)return 0;else return x<0?-1:1;}
bool operator == (const Point& A,const Point& B){return dcmp(A.x-B.x)==0 && dcmp(A.y-B.y)==0;}
double Dot(Vector A,Vector B){return A.x*B.x+A.y*B.y;}
double Length(Vector A){return sqrt(Dot(A,A));}
double Angle(Vector A,Vector B){return acos(Dot(A,B)/Length(A)/Length(B));}
double Cross(Vector A,Vector B){return A.x*B.y-A.y*B.x;}
double Area2(Point A,Point B,Point C){return Cross(B-A,C-A);}
double DistanceToLine(Point P,Point A,Point B){Vector v1=B-A,v2=P-A;return fabs(Cross(v1,v2))/Length(v1);}
Vector Normal(Vector A){double L=Length(A);return Vector(-A.y/L,A.x/L);}
Vector Rotate(Vector A,double rad){return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}
Point GetLineIntersection(Point P,Vector v,Point Q,Vector w){Vector u=P-Q;double t=Cross(w,u)/Cross(v,w);return P+v*t;  }
double PolygonArea(vector<Point>p){//duo area   
  double area=0;
  int n=p.size();
  for(int i=1;i<n-1;i++)area+=Cross(p[i]-p[0],p[i+1]-p[0]);
  return area/2;
}
double torad(double deg){return deg/180*acos(-1);}
vector<Point> ConvexHull(vector<Point>& p){
  sort(p.begin(), p.end());
  p.erase(unique(p.begin(), p.end()), p.end());
  int n = p.size();
  int m = 0;
  vector<Point> ch(n+1);
  for(int i = 0; i < n; i++) {while(m > 1 && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2]) <= 0) m--;ch[m++] = p[i];}
  int k = m;
  for(int i = n-2; i >= 0; i--) {while(m > k && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2]) <= 0) m--;ch[m++] = p[i];}
  if(n > 1) m--;
  ch.resize(m);
  return ch;
}
/*---------------------------------------------------------------------------------------------------------------------------*/

signed main() {
  vector<Point>P;
  int n;
  scanf("%lld\n",&n);
  //read(n);
  for(int i=0;i<n;i++){
    double x, y;
    scanf("%lf %lf\n",&x,&y);
    //read(x,y);
    Point o(x,y);
    P.push_back(o);
  }
  double area2 = PolygonArea(ConvexHull(P));
  int num=area2/50.0;
  printf("%d\n",num);
  return 0;
}