本题作为一道T2，符合其难度，dfs即可AC，与动态规划，无关，code：

#include <iostream>
#include <climits>

const int N = 205;

bool vis[N];
int n,ans = INT_MAX,now_cost = 0,r[N][N];

void dfs(int x){

    if (now_cost >= ans) return;
    if (x == n){

        ans = std::min(ans,now_cost);
        return;

    }
    for (int i = x + 1;i <= n;i++)
        if (!vis[i]){

            vis[i] = true;
            now_cost += r[x][i];
            dfs(i);
            now_cost -= r[x][i];
            vis[i] = false;

        }

}

int main(){

    #ifndef ONLINE_JUDGE
        freopen("P1359.in","r",stdin);
    #endif

    std::cin.tie(0)->sync_with_stdio(0);

    std::cin >> n;
    for (int i = 1;i < n;i++)
        for (int j = i + 1;j <= n;j++)
            std::cin >> r[i][j];
    vis[1] = true;
    dfs(1);
    std::cout << ans << '\n';

    return 0;
}

记录