POJ 3348 Cows(凸包)

ans = 凸包面积Area / 50 取整，我用的是刘汝佳的模板。

#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const double eps = 1e-10;
const int maxn = 10005;

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 - (Vector A, Vector 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 B)
{
	return Vector(A.x / B, A.y / B);
}

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;
}

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 GLIs(Point P, Vector V, Point Q, Vector W)
{
	Vector U = P - Q;
	double t = Cross(W, U) / Cross(V, W);
	return P + V * t;
}

Point GetLineProject(Point P, Point A, Point B)
{
	Vector v = B - A;
	return A + v * (Dot(v, P-A) / Dot(v, v));
}

bool SegmentProperIntersection(Point a1, Point a2, Point b1, Point b2)
{
	double c1 = Cross(a2 - a1, b1 - a1);
	double c2 = Cross(a2 - a1, b2 - a1);
	double c3 = Cross(b2 - b1, a1 - b1);
	double c4 = Cross(b2 - b1, a2 - b1);
	return (dcmp(c1) * dcmp(c2) < 0) && (dcmp(c3) * dcmp(c4) < 0);
}

bool OnSegment(Point p, Point a1, Point a2)
{
	return dcmp(Cross(a1-p, a2-p)) == 0 && dcmp(Dot(a1-p, a2-p)) < 0;
}

//计算二维凸包//

double ConvexPolygonArea(Point* p, int n)
{
      double area = 0;
      for (int i = 1;i < n - 1;i++)
            area += fabs(Cross(p[i] - p[0], p[i+1] - p[0])); // 保险起见
      return area / 2;
}

int Andrew(Point *p, int n, Point *ch)
{
      sort(p, p+n);
      int m = 0;
      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--;
      return m;
}

double CalcConvexHull(Point* p, int n)
{
      Point ch[maxn];
      int m = Andrew(p, n, ch);
      return ConvexPolygonArea(ch, m);
}
/

Point a[maxn];
int n;

int main()
{
      while (scanf("%d", &n) == 1)
      {
            for (int i = 0;i < n;i++)scanf("%lf%lf", &a[i].x, &a[i].y);
            double ans = CalcConvexHull(a, n);
            printf("%d\n", (int)(ans/50));
            //printf("%d\n", CalcConvexHull(a, n) / 50);
      }
      return 0;
}