UVA 10652 Board Wrapping 凸包

 题意：

求闭包的Andrew算法，在刘汝佳的 算法竞赛训练指南的272页有讲。

#include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
const double PI = acos(-1.0);
const double eps=1e-10;

struct Point{
	double x,y;
	Point(double x=0,double y=0) :x(x),y(y){}//默认值为0的构造函数
};
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 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);
}
//向量叉积
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));
}
double PolygonArea(Point *p,int n){
	double area=0;
	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*PI;
} 
int ConverHull(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;
} 
int main(){
	int N;
	Point p[2500],ch[2500];
	scanf("%d",&N);
	while(N--){
		int n,pc=0;
		double area=0;
		scanf("%d",&n);
		for(int i=0;i<n;i++){
			double x,y,w,h,j,rad;
			scanf("%lf%lf%lf%lf%lf",&x,&y,&w,&h,&j);
			Point o(x,y);
			rad=-torad(j);
			p[pc++]=o+Rotate(Vector(-w/2,-h/2),rad);
			p[pc++]=o+Rotate(Vector(w/2,-h/2),rad);
			p[pc++]=o+Rotate(Vector(-w/2,h/2),rad);
			p[pc++]=o+Rotate(Vector(w/2,h/2),rad);
			area+=w*h;
		}
		int m=ConverHull(p,pc,ch);
		double area2=PolygonArea(ch,m);
		printf("%.1lf %%\n",area*100/area2);
	}
	return 0; 
}