最小方差生成树

#include<bits/stdc++.h>
#define maxn 2005
using namespace std;

int n,m;
int F[105];
int x[maxn],y[maxn],w[maxn],b[maxn],c[maxn];
bool usd[maxn];
int Find(int now){ return !F[now] ? now : F[now] = Find(F[now]); }
vector<double>vec;
double ans=0x3f3f3f3f,cc[maxn];
inline bool cmp(const int &u,const int &v){ return  cc[u] < cc[v];}

void solve(double val)
{
	double ave = val / (n-1);
	for(int i=1;i<=m;i++) cc[i] = (w[i]-ave) * (w[i]-ave);
	sort(c+1,c+1+m,cmp);
	
	memset(F,0,sizeof F);
	double ret = 0 , sum = 0;
	for(int i=1;i<=m;i++)
		if(Find(x[c[i]])!=Find(y[c[i]]))
		{
			sum += w[c[i]];
			ret += cc[c[i]];
			F[Find(x[c[i]])] = Find(y[c[i]]);
		}
	if(sum == val) 
		ans = min(ans ,sqrt(ret/(n-1)));
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++) scanf("%d%d%d",&x[i],&y[i],&w[i]),b[i]=w[i],c[i]=i,cc[i]=w[i];
	sort(c+1,c+1+m,cmp);
	
	int minx=0,maxx=0;
	for(int i=1;i<=n-1;i++) minx+=w[c[i]];
	for(int i=m;i>=m-n+1;i--) maxx+=w[c[i]];
	
	for(double i=minx;i<=maxx;i+=1)
		solve(i);
	printf("%.4lf\n",ans);
}

LCT预处理替换边的时间然后扫描线可以做到$O(n\log n)$