HDU - 4081（kruskal）

Qin Shi Huang’s National Road System HDU - 4081

思路

用到了求次小生成树的数组，代码也跟次小生成树模板差不多，题目要求A/B的最大值，所以求一遍最小生成树之后，暴力枚举每条边作为魔法路径（题目中的magic road）算一遍A/B，取个最大值就好了。

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
const int MAXN = 1005;
int x[MAXN], y[MAXN];
double p[MAXN];
int n;
struct edge {
	int u, v;
	double w;
	int vis;
	edge() {};
	edge(int u, int v, double w,int vis) :u(u), v(v), w(w),vis(vis) {};
}e[MAXN * MAXN];
vector<int>G[MAXN];
double dist[MAXN][MAXN];
int father[MAXN];
bool cmp(const edge& a, const edge& b) {
	return a.w < b.w;
}
double dis(int a, int b) {
	return sqrt((x[a] - x[b]) * (x[a] - x[b]) + (y[a] - y[b]) * (y[a] - y[b]));
}
int find_(int x) {
	if (x == father[x])return x;
	return father[x] = find_(father[x]);
}
int main() {
	int t;
	//freopen("Text.txt", "r", stdin);
	cin >> t;
	while (t--) {
		scanf("%d", &n);
		for (int i = 1; i <= n; i++) { 
			father[i] = i; 
			e[i].vis = 0;
			G[i].clear();
		}
		for (int i = 1; i <= n; i++) {
			int a, b, c;
			scanf("%d%d%lf", &x[i], &y[i], &p[i]);
			G[i].push_back(i);
		}
		int m = 0;
		for (int i = 1; i <= n; i++) {
			for (int j = i + 1; j <= n; j++) {
				e[++m] = edge(i, j, dis(i, j),0);
			}
		}
		sort(e + 1, e + 1 + m, cmp);
		int num = 0;
		double ans = 0;
		for (int i = 1; i <= m; i++) {
			int X = find_(e[i].u), Y = find_(e[i].v);
			if (X == Y) {
				continue;
			}
			
			int len_a = G[X].size(), len_b = G[Y].size();
			for (int j = 0; j < len_a; j++) {
				for (int k = 0; k < len_b; k++) {
					dist[G[X][j]][G[Y][k]] = dist[G[Y][k]][G[X][j]] = e[i].w;
				}
			}
			num++;
			e[i].vis = 1;
			father[X] = Y;
			ans += e[i].w;
			for (int j = 0; j < len_a; j++) {
				G[Y].push_back(G[X][j]);
			}
			if (num == n - 1)break;
		}
		double res = 0;
		for (int i = 1; i <= m; i++) {
			if (e[i].vis) {
				res = max(res, (p[e[i].u] + p[e[i].v]) / (ans - e[i].w));
			}
			else {
				res = max(res, (p[e[i].u] + p[e[i].v]) / (ans - dist[e[i].u][e[i].v]));
			}
		}
		printf("%.2lf\n", res);
	}
	return 0;
}