UVA 11168 Airport 凸包 .

题目地址：https://vjudge.net/problem/UVA-11168

线是凸包上的相邻两点组成的线

再每条线都枚举一下，求出最小值

#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b)  for(int i=a;i<=(int)(b);++i)
#define REPD(i,a,b) for(int i=a;i>=(int)(b);--i)
const double PI=acos(-1);
const double EPS=1e-6;
int dcmp(double x){
	if(fabs(x)<EPS) return 0;
	return x > 0 ? 1 : -1;
}
struct Point{
	double x,y;
};
typedef Point Vector;
bool operator < (const Point& p1, const Point& p2){	return p1.x<p2.x || (p1.x==p2.x && p1.y<p2.y) ;}
Vector operator / (const Point& A, double x){	return Vector{A.x/x, A.y/x};}
Vector operator * (const Vector& A, double x){	return Vector{A.x*x, A.y*x};}
Vector operator - (const Vector& A, const Vector& B){	return Vector{A.x-B.x,A.y-B.y};}
Vector operator + (const Point& A, const Vector& v){	return Point{A.x+v.x,A.y+v.y};}
Vector Rotate(const Point& p,double ang){	return Vector{p.x*cos(ang)-p.y*sin(ang),p.x*sin(ang)+p.y*cos(ang)};}
double Cross(const Vector& A, const Vector& B){	return A.x*B.y-A.y*B.x;}
double Dot(Vector A, Vector B){	return A.x*B.x+A.y*B.y;}
double Length(Vector v){	return sqrt(fabs(Dot(v,v)));}
Vector Unit(Vector v){	return v/Length(v);}

double DistanceToLine(const Point& P, const Point& A, const Point& B){
	return fabs(Cross(B-A,P-A)/Length(A-B));
}
const int maxn=10000+10;
Point points[maxn],ch[maxn];
int convexHull(Point* A,int n,Point* sol){
	sort(A,A+n);
	int m=0;
	REP(i,0,n-1){
		while(m>1 && dcmp( Cross(sol[m-1]-sol[m-2], A[i]-sol[m-1]) <= 0) ) m--;
		sol[m++]=A[i];
	}
	int k=m;
	REPD(i,n-2,0){
		while(m>k && dcmp( Cross(sol[m-1]-sol[m-2], A[i]-sol[m-1]) <= 0) ) m--;
		sol[m++]=A[i];
	}
	if(n > 1) m--;
	return m;
}
int main(int argc, char const *argv[])
{
	// freopen("input.in","r",stdin);
	int T,n,kase=0; scanf("%d",&T);
	while(T--&&scanf("%d",&n)==1){
		REP(i,0,n-1) {
			double x,y;
			scanf("%lf%lf",&x,&y);
			points[i]=Point{x,y};
		}
		int cnt=convexHull(points,n,ch);
		double ans=1e16;
		REP(i,0,cnt-1) {
			double t=0;
			REP(k,0,n-1) {
				t+=DistanceToLine(points[k],ch[i],ch[(i+1)%cnt]);
				/*  或者用点到线的方程求 l=|Ax0+By0+C|/sqrt(A*A+B*B);
				double a=ch[i].x,b=ch[i].y,c=ch[(i+1)%cnt].x,d=ch[(i+1)%cnt].y;
				double x0=points[k].x,y0=points[k].y;
				double A=b-d;
				double B=c-a;
				double C=b*(a-c)-a*(b-d);
				t+=fabs(A*x0+B*y0+C) / sqrt(A*A+B*B);
				*/
				if(dcmp(t-ans)>0) break;
			}
			ans=min(ans,t);
		}
		if(cnt==1) ans=0;   //注意只有一个点的情况
		printf("Case #%d: %.3lf\n", ++kase,ans/n);
	}
	return 0;
}