题目概述
给出
n
个点
解题报告
也是分数规划的经典题目(搞事啊,为什么经典题目我现在才知道啊),首先二分枚举答案
mid
,然后用
c−mid×d
建边(代价
c
,距离
示例程序
#include<cstdio>
#include<cmath>
using namespace std;
typedef double DB;
const int maxn=1000;
int n,a[maxn+5],x[maxn+5],y[maxn+5],z[maxn+5];
DB dis[maxn+5][maxn+5],lowcst[maxn+5];bool vis[maxn+5];
inline int fcmp(DB a,DB b) {if (fabs(a-b)<1e-10) return 0;if (a<b) return -1;return 1;}
#define cst(i,j) (fabs(z[i]-z[j])-mid*dis[i][j])
inline bool check(DB mid)
{
DB ans=0;for (int i=1;i<=n;i++) lowcst[i]=cst(1,i),vis[i]=false;vis[1]=true;
for (int i=1;i<=n-1;i++)
{
DB MIN=1e100;int k=0;
for (int j=1;j<=n;j++) if (!vis[j]&&lowcst[j]<MIN) MIN=lowcst[k=j];
ans+=MIN;vis[k]=true;
for (int j=1;j<=n;j++) if (!vis[j]&&cst(k,j)<lowcst[j]) lowcst[j]=cst(k,j);
}
return fcmp(ans,0)<=0;
}
#define sqr(x) ((x)*(x))
int main()
{
freopen("program.in","r",stdin);
freopen("program.out","w",stdout);
for (scanf("%d",&n);n;scanf("%d",&n))
{
for (int i=1;i<=n;i++) scanf("%d%d%d",&x[i],&y[i],&z[i]);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
dis[i][j]=sqrt(sqr(x[i]-x[j])+sqr(y[i]-y[j]));
DB L=0,R=1e10;
for (DB mid=(L+R)/2;fcmp(L,R)<=0;mid=(L+R)/2)
if (check(mid)) R=mid-1e-5; else L=mid+1e-5;
printf("%.3f\n",L);
}
return 0;
}