【纯思考】P1268 树的重量

#include<iostream>
#include<algorithm>
using namespace std;

int n;
int dis[35][35];

int main()
{
    while (cin >> n)
    {
        if (!n) break;
        for (int i = 1; i < n; i++)
        {
            for (int j = i + 1; j <= n; j++)
            {
                cin >> dis[i][j];
            }
        }
        int sum = dis[1][2];
        for (int i = 3; i <= n; i++)
        {
            int minn = 0x3f3f3f3f;
            for (int j = 2; j < i; j++)
            {
                minn = min(minn, (dis[1][i] - dis[1][j] + dis[j][i]) >> 1);
            }
            sum += minn;
        }
        cout << sum << endl;
    }
    return 0;
}