https://www.luogu.org/blog/user4341/solution-p1268
给出一种对这道题做法的解释,具体代码实现如下
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
using namespace std;
const int maxn=40;
int dis[maxn][maxn];
int ans=1e9,sum,tot;
int main()
{
int n;
while(cin>>n&&n!=0)
{
sum=0;
for(int i=1;i<=n-1;i++)
{
for(int j=i+1;j<=n;j++)
{
int x;
cin>>x;
dis[i][j]=x;
dis[j][i]=x;
}
}
sum=dis[1][2];
for(int i=3;i<=n;i++)
{
ans=1e9;
for(int j=2;j<=i-1;j++)
{
tot=(dis[1][i]+dis[j][i]-dis[1][j])/2;
//cout<<tot<<' ';
ans=min(ans,tot);
}
sum+=ans;
}
cout<<sum<<endl;
}
return 0;
}