题意:给出一些圆,选择其中一个圆的圆心为圆心,然后画一个大圆,要求大圆最少覆盖每个圆的一半面积。求最小面积。
解题思路:首先枚举每个圆,以其圆心作为大圆的圆心,然后再用二分去寻找最小的半径。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn = 20;
const double eps = 1e-8;
const double pi = 3.14159265;
struct Circle
{
double x,y,r;
}p[maxn];
int n;
double dist(double x1,double y1,double x2,double y2)
{
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
double Area(double x0,double y0,double radius,Circle p)
{
double d = dist(x0,y0,p.x,p.y);
if(d >= radius + p.r) return 0;
else if(d <= fabs(radius - p.r)) return min(radius,p.r) * min(radius,p.r) * pi;
//计算两个角度
double a = acos((radius * radius + d * d - p.r * p.r) / (2 * radius * d));
double b = acos((p.r * p.r + d * d - radius * radius) / (2 * p.r * d));
return radius * radius * a + p.r * p.r * b - radius * d * sin(a);
}
bool Check(int k,double radius)
{
for(int i = 1; i <= n; i++)
if(Area(p[k].x,p[k].y,radius,p[i]) < p[i].r * p[i].r * pi / 2.0)
return false;
return true;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
double l,r,mid,ans = 9999999.0;
for(int i = 1; i <= n; i++)
scanf("%lf%lf%lf",&p[i].x,&p[i].y,&p[i].r);
for(int i = 1; i <= n; i++) //枚举圆心
{
l = 0, r = 500000;
while(r - l > eps)
{
mid = (l + r) / 2.0;
if(Check(i,mid) == true)
{
ans = min(ans,mid);
r = mid;
}
else l = mid;
}
}
printf("%.4f\n",ans);
}
return 0;
}