poj 2079 Triangle（旋转卡壳）

平面上给出一些点，求这些形成三角形中最大的面积。

思路：先求一次凸包，然后在凸包上枚举三角形的第一个顶点i，把其他两个顶点拿来旋转。开始没有考虑到三角形的边可以不是凸包上的边，就当做求凸包直径那样旋转，结果wa到吐。。。。

#include<iostream>
#include<algorithm>
#include<string.h>
#include<stack>
#include<queue>
#include<math.h>
#include<cstdio>

using namespace std;
struct point
{
	int x,y;
	point() {}
	point(int x,int y): x(x),y(y) {}
}p[50010],res[50010];

int cross(point a,point b,point op)
{
	return (a.x-op.x)*(b.y-op.y)-(a.y-op.y)*(b.x-op.x);	
}

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

bool operator < (const point &l, const point &r)
{
	return l.y < r.y || (l.y == r.y && l.x < r.x);
}
int graham(point pnt[], int n, point res[])
{
	int i, len, k = 0, top = 1;
	sort(pnt, pnt + n);
	if (n == 0) return 0; res[0] = pnt[0];
	if (n == 1) return 1; res[1] = pnt[1];
	if (n == 2) return 2; res[2] = pnt[2];
	for (i = 2; i < n; i++) 
	{
		while (top && mult(pnt[i], res[top], res[top-1]))
			top--;
		res[++top] = pnt[i];
	}
	len = top; res[++top] = pnt[n - 2];
	for (i = n - 3; i >= 0; i--) 
	{
		while (top!=len && mult(pnt[i], res[top],
			res[top-1])) top--;
		res[++top] = pnt[i];
	}
	return top;
}
double rc(point pnt[],int n)
{
	int ans=0;
	int k=2,j=1;
	pnt[n]=pnt[0];
	for(int i=0;i<n;i++)
	{
		while(abs(cross(pnt[i],pnt[j],pnt[(k+1)%n]))>abs(cross(pnt[i],pnt[j],pnt[k])))
			k=(k+1)%n;	
		ans=max(ans,abs(cross(pnt[i],pnt[j],pnt[k])));
		while(abs(cross(pnt[i],pnt[(j+1)%n],pnt[k]))>abs(cross(pnt[i],pnt[j],pnt[k])))
			j=(j+1)%n;
		ans=max(ans,abs(cross(pnt[i],pnt[j],pnt[k])));
	}
	return ans*0.5;
}
int main()
{
	int n;
//	freopen("in.txt","r",stdin);
//	freopen("out.txt","w",stdout);
	while(~scanf("%d",&n))
	{
		if(n==-1) break;	
		for(int i=0;i<n;i++)
			scanf("%d%d",&p[i].x,&p[i].y);
		int cnt=graham(p,n,res);
		printf("%.2lf\n",rc(res,cnt));
	}
	return 0;
}