一开始随机选一个点,然后向四周随机移动,结果不是wa就是TLE,后来看了ch_g的博客,向最远的点靠近移动
题意:求覆盖空间所有点的球最小半径
代码如下:
#include<cstdio>#include<cstring>#include<iostream>#include<math.h>#include<cstdlib>#include<algorithm>#define F(i,n) for(int i=0;i<n;i++)#define pi acos(-1.0)#define sqr(x) ((x)*(x))#define Max(a,b) a>b?a:b#define Min(a,b) a<b?a:b#define maxn 50#define eps 1e-8
using namespace std;
struct cpoint{double x,y,z,d;};cpoint cp[maxn],rp;int n;double dis(cpoint p,cpoint q){return sqrt(sqr(p.x-q.x)+sqr(p.y-q.y)+sqr(p.z-q.z));}void solve() //朝着最远的点的方向调整步长{int L=30,id,ip;rp.x=double((rand()%1000+1)/1000.00000*100);rp.y=double((rand()%1000+1)/1000.00000*100);rp.z=double((rand()%1000+1)/1000.00000*100);rp.d=0.0;F(i,n){if(dis(rp,cp[i])>rp.d){rp.d=dis(rp,cp[i]);id=i;}}double dal=100;while(dal>eps){F(i,L){rp.x+=dal*(cp[id].x-rp.x)/rp.d;rp.y+=dal*(cp[id].y-rp.y)/rp.d;rp.z+=dal*(cp[id].z-rp.z)/rp.d;rp.d=0.0;F(j,n){if(dis(rp,cp[j])>rp.d){id=j;rp.d=dis(rp,cp[j]);}}}dal*=0.98;}printf("%.5lf\n",rp.d);}int main(){while(scanf("%d",&n)!=EOF){if(n==0) break;for(int i=0;i<n;i++)scanf("%lf %lf %lf",&cp[i].x,&cp[i].y,&cp[i].z);solve();}return 0;}