hdu 4667 Building Fence

给出n个圆和m个三角形，然后用篱笆把它们围起来，问需要最短的篱笆长度是多少。

这题标称应该是求出每个三角形的每个顶点与每个圆的切点和两两圆之间的切点，然后切点来做凸包，最后把凸包上的点的距离加起来，注意在一个圆上两个点的距离是他们的

弧长，我做的时候就直接暴力了，把每个圆拆点，然后把所有点再来做凸包，最后求距离和

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

#define maxn 500000
using namespace std;
const double PI=acos(-1.0);
const double eps=1e-7;

struct point 
{ 
	double x, y;
}p[maxn],res[maxn];

double dist(point a,point b)
{
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));	
}
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;
}

int main()
{
	int n,m,e;
	double x,y,r,x0,y0,x1,x2,y1,y2;
	while(~scanf("%d%d",&n,&m))
	{
		e=0;
		for(int i=0;i<n;i++)	
		{
			scanf("%lf%lf%lf",&x,&y,&r);
			for(double j=0;j<2*PI;j+=0.003)
			{
				p[e].x=x+r*cos(j);
				p[e++].y=y+r*sin(j);
			}
		}
		for(int i=1;i<=m;i++)
		{
			scanf("%lf%lf%lf%lf%lf%lf",&x0,&y0,&x1,&y1,&x2,&y2);
			p[e].x=x0;
			p[e++].y=y0;
			p[e].x=x1;
			p[e++].y=y1;
			p[e].x=x2;
			p[e++].y=y2;	
		}
		int cnt=graham(p,e,res);
		double ans=0;
		for(int i=0;i<cnt;i++)
			ans+=dist(res[i],res[i+1]);
		ans+=dist(res[0],res[cnt]);
		printf("%.5lf\n",ans);
	}
	return 0;
}