题目大意
给你一幅
n
个点,
n≤200
m≤19900
解题思路
可以直接枚举每条边,找出每条边的最有点,然后再在所有边中找到最有的边。
对于一条连接
u,v
的边。设
ai
表示从节点
i
到
程序
//YxuanwKeith
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAXN = 205, MAXM = 2e4 + 5;
struct Node {
int u, v, w;
} p[MAXM];
struct Node2 {
double num;
int id;
} t[MAXN];
int n, m, dis[MAXN][MAXN], mx[MAXN];
double ans;
bool cmp(Node2 a, Node2 b) {
return a.num < b.num;
}
void floyd() {
for (int k = 1; k <= n; k ++)
for (int i = 1; i <= n; i ++) {
if (i == k) continue;
for (int j = 1; j <= n; j ++) {
if (i == j || k == j) continue;
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
}
}
}
double calc(double s, int m1, int m2, int w) {
return max(m1 + s, m2 + w - s);
}
void solve() {
for (int i = 1; i <= m; i ++) {
int u = p[i].u, v = p[i].v, w = p[i].w;
for (int j = 1; j <= n; j ++) {
t[j].num = 1.0 * (dis[v][j] + w - dis[u][j]) / 2;
t[j].id = j;
}
sort(t + 1, t + n + 1, cmp);
mx[n + 1] = 0;
for (int j = n; j; j --) mx[j] = max(mx[j + 1], dis[u][t[j].id]);
int s = 0;
t[n + 1].num = w;
for (int j = 1; j <= n + 1; j ++) {
double side = 1.0 * (s - mx[j] + w) / 2;
if (side >= t[j - 1].num && side <= t[j].num) ans = min(ans, calc(side, mx[j], s, w)); else
ans = min(ans, max(calc(t[j - 1].num, mx[j], s, w), calc(t[j].num, mx[j], s, w)));
s = max(s, dis[v][t[j].id]);
}
}
}
int main() {
scanf("%d%d", &n, &m);
double l = 0, r = 0;
memset(dis, 60, sizeof dis);
for (int i = 1; i <= m; i ++) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
dis[u][v] = min(dis[u][v], w);
dis[v][u] = min(dis[v][u], w);
r = r + w;
p[i].u = u, p[i].v = v, p[i].w = w;
}
floyd();
for (int i = 1; i <= n; i ++) dis[i][i] = 0;
ans = 1e9 + 7;
solve();
printf("%.2lf", ans);
}