题目连接
读完这题,思考后还以为用啥高级的图论算法。。。半天想不懂,一看评论傻眼了。
首先我们易知当n=2时有
ans = dis[1][2]
而对于第k条边(k >= 3)这条边则可能时从第i到第j的(i, j < k)路径分裂出来。于是枚举一下就行了。
len = (dis[i][k] + dis[j][k] - dis[i][j]) >> 1
下面是ac代码
#include <iostream>
#include <string>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
int dis[36][36];
int main()
{
int n;
while(cin >> n, n)
{
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
scanf("%d", &dis[i][j]);
int ans = dis[1][2];
for (int i = 3; i <= n; i++)
{
int len = 0x7fffffff;
for (int j = 1; j < i; j++)
{
for (int k = 1; k < j; k++)
{
if (dis[k][i] + dis[j][i] - dis[k][j] < 0) continue;
len = min(len, (dis[k][i] + dis[j][i] - dis[k][j]) >> 1);
}
}
ans += len;
}
printf("%d\n", ans);
}
return 0;
}