租用游艇——洛谷1359

最新推荐文章于 2024-07-23 22:06:37 发布

华年的小年华

最新推荐文章于 2024-07-23 22:06:37 发布

阅读量55

点赞数

分类专栏： dp 文章标签：算法 c++ Powered by 金山文档

本文链接：https://blog.csdn.net/Yapink/article/details/129032689

版权

dp 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstring>

using namespace std;

const int N = 1000010, M = 210;

int n;
int w[M][M];
int f[N];

int main()
{
    scanf("%d", &n);
    for (int i = 1; i < n; i ++ ) 
        for (int j = i + 1; j <= n; j ++ )
            cin >> w[i][j];

    for (int i = 1; i <= n; i ++ ) 
    {
        f[i] = w[1][i];
        for (int j = 1; j < i; j ++ ) 
            f[i] = min(f[i], f[j] + w[j][i]);
    }

    cout << f[n] << endl;
    return 0;
}