题目链接
http://poj.org/problem?id=2069
思路
就是要求最小球覆盖。。。
我们首先找个点作为搜索的起点,然后不断减少移动步长。。。
但是要注意每次移动时一定要往距离当前圆心最远的点的方向移动!这样的话肯定是能尽快找到最优解的,我刚开始写的是若新的解比旧的解更优,就移动圆心,这样做显然就会错!
代码
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cmath>
#define EPS (1e-8)
using namespace std;
struct Point
{
double x,y,z;
}points[55];
int n,q;
inline double dist(Point a,Point b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z));
}
double ClimbHill(Point center) //爬山
{
double ans=1e20;
double delta=100;
while(delta>EPS)
{
int p=1; //p=离球心最远的点的编号
for(int i=1;i<=n;i++)
if(dist(points[i],center)>dist(points[p],center))
p=i;
double nowr=dist(points[p],center);
ans=min(ans,nowr); //!!!!!
center.x+=(points[p].x-center.x)/nowr*delta;
center.y+=(points[p].y-center.y)/nowr*delta;
center.z+=(points[p].z-center.z)/nowr*delta;
delta*=0.98;
}
return ans;
}
int main()
{
while(scanf("%d",&n)!=EOF&&n)
{
Point center;
center.x=center.y=center.z=0;
for(int i=1;i<=n;i++)
{
scanf("%lf%lf%lf",&points[i].x,&points[i].y,&points[i].z);
center.x+=points[i].x,center.y+=points[i].y,center.z+=points[i].z;
}
center.x=0,center.y=0,center.z=0;
printf("%.5lf\n",ClimbHill(center));
}
return 0;
}