Justice is Given by Light,一条计算几何

http://acm.uestc.edu.cn/#/problem/show/814

一条简单的计算几何，也是我的开篇之作。

其实挺简单的，只要注意到一条边可以被一个圆完全包含，也能被两条边完全包含即可。

曾经看到一个二分r的题解，不推荐那样做。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
inline double ss(double a,double b,double c,double d)  //求点与点距离
{
	return sqrt((a-c)*(a-c)+(b-d)*(b-d));
}
double x[22],y[22],x_1,x_2,y_1,y_2,x_0,y_0;
double count_len(int i)      //计算要包含第i个点与第i+1个点所需最小半径
{
	double a1=ss(x_1,y_1,x[i],y[i]),a2=ss(x_2,y_2,x[i],y[i]),b1=ss(x_1,y_1,x[i+1],y[i+1]),b2=ss(x_2,y_2,x[i+1],y[i+1]);
	double r=0;
	r=min<double>(max<double>(a1,b1),max<double>(a2,b2));
	if(fabs(y_1-y_2)<1e-6) {
		if(x[i]<=x_0&&x[i+1]>=x_0||x[i+1]<=x_0&&x[i]>=x_0) {
			double yy=(y[i+1]-y[i])/(x[i+1]-x[i])*(x_0-x[i])+y[i]-y_0;
			r=min<double>(r,max<double>(sqrt(yy*yy+(x_0-x_1)*(x_0-x_1)),max<double>(min<double>(a1,a2),min<double>(b1,b2))));
		}
	}
	else {
		double k=(x_1-x_2)/(y_2-y_1);
		if(fabs(x[i]-x[i+1])<1e-6) {
			double yy=y_0+k*(x[i]-x_0);
			if(yy>=y[i]&&yy<=y[i+1]||yy>=y[i+1]&&yy<=y[i])
				r=min<double>(r,max<double>(ss(x_1,y_1,x[i],yy),max<double>(min<double>(a1,a2),min<double>(b1,b2))));
		}
		else {
			double ki=(y[i+1]-y[i])/(x[i+1]-x[i]);
			double xx=(ki*x[i]+y_0-y[i]-k*x_0)/(ki-k);
			double yy=y[i]+ki*(xx-x[i]);
			if(xx<=x[i]&&xx>=x[i+1]||xx<=x[i+1]&&xx>=x[i])
				r=min<double>(r,max<double>(ss(x_1,y_1,xx,yy),max<double>(min<double>(a1,a2),min<double>(b1,b2))));
		}
	}
	return r;
}
int main()
{
//	freopen("aa.txt","r",stdin);
	int n,i;
	double ans=0;
	cin>>n;
	for(i=1;i<=n;i++)
		cin>>x[i]>>y[i];
	x[n+1]=x[1];
	y[n+1]=y[1];
	cin>>x_1>>y_1>>x_2>>y_2;
	x_0=(x_1+x_2)/2;
	y_0=(y_1+y_2)/2;
	for(i=1;i<=n;i++)
		ans=max<double>(ans,count_len(i));
	cout.setf(ios::fixed);
	cout.precision(3);
	cout<<ans;
}