Kattis - largesttriangle Largest Triangle 平面最大三角形面积

题目链接：https://vjudge.net/problem/Kattis-largesttriangle

题意：任意三点的最大三角形面积

题解：首先想到最大的面积应该出现在凸包上，然后就是枚举任意两点，能想到第三点是满足线性的，所以第三点线性来求，复杂度n^2，注意一点就是在多加n个，因为要转一圈

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define eps 1e-8
const int N = 5100;
 
int sgn(double x) {
	if(fabs(x) < eps) return 0;
	if(x < 0) return -1;
	return 1;
}
struct Point {
	double x, y;
	
	Point(double x_ = 0, double y_ = 0) {
		x = x_;
		y = y_;
	}
	bool operator ==(Point b)const {
		return sgn(x - b.x) == 0 && sgn(y - b.y) == 0;
	}
	Point operator -(const Point &b) const {
		return Point(x - b.x, y - b.y);
	}
	Point operator +(const Point &b) const {
		return Point(x + b.x, y + b.y);
	}
	bool operator <(const Point &b)const {
		return sgn(x - b.x) == 0 ? sgn(y - b.y) < 0 :x < b.x;
	}
	double operator ^(const Point &b) const {
		return x * b.y - y * b.x;
	}
	double operator *(const Point &b) const {
		return x * b.x + y * b.y;
	}
	double distance(Point b) {
		return sqrt((x - b.x) * (x - b.x) + (y - b.y) * (y - b.y));
	}
}a[N];
struct polygon {
	int n;
	Point p[N * 2];
	struct cmp {
		Point p;
		cmp(const Point &p0) {
			p = p0;
		}
		bool operator()(const Point &aa, const Point &bb) const{
			Point a = aa, b = bb;
			int d = sgn((a - p) ^ (b - p));
			if(d == 0) return sgn(a.distance(p) - b.distance(p)) < 0;
			return d > 0;
		}
		
	};
	void norm() {
		Point mi = p[0];
		for(int i = 1; i < n; i++) {
			mi = min(mi, p[i]);
		}
		sort(p, p + n, cmp(mi)); 
	}
	void getconvex(polygon &convex) {
		norm();
		convex.n = n;
		for(int i = 0; i < min(n , 2); i++) {
			convex.p[i] = p[i];
		}
		if(convex.n == 2 && (convex.p[0] == convex.p[1])) convex.n--;
		if(n <= 2) return;
		int &top = convex.n;
		top = 1;
		for(int i = 2; i < n; i++) {
			while(top && sgn((convex.p[top] - p[i]) ^ (convex.p[top - 1] - p[i])) <= 0) top--;
			convex.p[++top] = p[i];
		}
		int temp = top;
		convex.p[++top] = p[n - 2];
		for(int i = n - 3; i >= 0; i--) {
			while(top != temp && sgn((convex.p[top] - p[i]) ^ (convex.p[top - 1] - p[i])) <= 0)
				top--;
			convex.p[++top] = p[i];
		}
		if(convex.n == 2 && (convex.p[0] == convex.p[1])) convex.n--;
		convex.norm();
	}
}P, A;
double getT(Point x, Point y, Point z) {
	double x1, x2, y1, y2;
	x1 = y.x - x.x;
	y1 = y.y - x.y;
	x2 = z.x - x.x;
	y2 = z.y - x.y;
	return fabs(x1 * y2 - x2 * y1) / 2;
}
int main() {
	scanf("%d", &P.n);
	for(int i = 0; i < P.n; i++)
		scanf("%lf %lf", &P.p[i].x, &P.p[i].y);
	P.getconvex(A);
	double ans = 0, cnt, tmp;
	for(int i = 0; i < A.n; i++) A.p[i + A.n] = A.p[i]; 
	A.n += A.n;
	for(int i = 0, j, k; i < A.n - 2; i++) {
		j = i + 1;
		k = j + 1;
		cnt = getT(A.p[i], A.p[j], A.p[k]);
		ans = max(cnt, ans);
		while(k + 1 < A.n && (tmp = getT(A.p[i], A.p[j], A.p[k + 1])) > cnt) {
			k++;
			ans = max(ans, tmp);
			cnt = tmp;
		}
		while(j + 1 < A.n - 1) {
			j++;
			cnt = getT(A.p[i], A.p[j], A.p[k]);
			ans = max(ans, cnt);
			while(k + 1 < A.n && (tmp = getT(A.p[i], A.p[j], A.p[k + 1])) > cnt) {
				ans = max(ans, tmp);
				cnt = tmp;
				k++;
			}
		}
	}
	printf("%.5lf\n", ans);
	return 0;
}