【图论 最小生成树】JZOJ_3410 Tree

题意

求一张图的生成树，使得边的标准差最小。

思路

标准差最小，肯定是上面的分子最小。

枚举一个数，设它为平均数，这样子生成树的样子还是不会变的。
那么按照$(a_i-ave{)}^2$为边权排序做最小生成树，计算这些边的标准差更新答案。

代码

#include <cmath>
#include <cstdio>
#include <algorithm>

struct node {
	int u, v, w;
	double c;
}edge[2001];

int n, m;
int father[101];
double ans;

bool operator <(const node &a, const node &b) {
	return a.c < b.c;
}

int find(int x) {
	return father[x] = father[x] != x ? find(father[x]) : x;
}

int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++)
		scanf("%d %d %d", &edge[i].u, &edge[i].v, &edge[i].w);
	ans = 1000;
	for (double d = 0.25; d <= 100; d += 0.25) {
		for (int i = 1; i <= m; i++)
			edge[i].c = (edge[i].w - d) * (edge[i].w - d);
		for (int i = 1; i <= n; i++)
			father[i] = i;
		std::sort(edge + 1, edge + m + 1);
		int cnt = 0, sumX = 0, sumP = 0;
		for (int i = 1; i <= m; i++) {
			int f1 = find(edge[i].u), f2 = find(edge[i].v);
			if (f1 == f2) continue;
			father[f1] = f2;
			sumX += edge[i].w;
			sumP += edge[i].w * edge[i].w;
			if (++cnt == n - 1) break;
		}
		double p = sqrt((sumP + cnt * ((double)sumX / cnt) * ((double)sumX / cnt) - 2 * ((double)sumX / cnt) * sumX) / cnt);
		ans = std::min(ans, p);
	}
	printf("%.4lf", ans);
}