1、Floyd算法 算出每两个节点之间的额最短距离, 复杂度O(N^3) = O(10^6)
2、遍历所有节点,找出在某个节点建医院,所有点到医院的总距离最短。
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <iostream>
using namespace std;
const int MaxN = 110;
int d[MaxN][MaxN];
int n, m; //点数,边数
int people[MaxN];
void Floyd()
{
for(int k = 1; k <= n; ++k)
{
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
{
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
int main()
{
memset(d, 0x3f, sizeof d);
scanf("%d", &n);
int x, y;
for(int i = 1; i <= n; ++i)
{
scanf("%d%d%d", &people[i], &x, &y);
if(x)
d[i][x] = d[x][i] = 1;
if(y)
d[i][y] = d[y][i] = 1;
}
Floyd();
int ans = 0x3f3f3f3f;
for(int i = 1; i <= n; ++i)
{
int p = 0;
for(int j = 1; j <= n; ++j)
{
if(i != j)
p += d[i][j] * people[j];
}
ans = min(ans, p);
}
printf("%d\n", ans);
return 0;
}
/*
5
13 2 3
4 0 0
12 4 5
20 0 0
40 0 0
*/
/*
81
*/