AcWing 898. 数字三角形【动态规划】【线性DP】

---

一、题目链接

AcWing 898. 数字三角形

---

二、题目分析

（一）算法标签

动态规划 线性DP

（二）解题思路

---

三、AC代码

解法一(二维正序):

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 510, INF = 0x3f3f3f3f;

// f[i][j]表示从(1,1)走到了(i,j)(第i行第j列)的总和
// 集合划分:从左上走下来的、从右上走下来的
int f[N][N];

int n;
int a[N][N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= i; j ++ )
            scanf("%d", &a[i][j]);
    // 初始化
    for (int i = 1; i <= n; i ++ )
        for (int j = 0; j <= i + 1; j ++ )
            f[i][j] = -INF;
    f[1][1] = a[1][1];
    for (int i = 2; i <= n; i ++ )
        for (int j = 1; j <= i; j ++ )
            // 左上：f[i-1][j-1] 右上：f[i-1][j]
            f[i][j] = max(f[i - 1][j - 1], f[i - 1][j]) + a[i][j];
    int res = -INF;
    for (int i = 1; i <= n; i ++ )
        res = max(res, f[n][i]);
    cout << res << endl;
    return 0;
}

解法二(一维正序):

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 510, INF = 0x3f3f3f3f;


int f[N];

int n;
int a[N][N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= i; j ++ )
            scanf("%d", &a[i][j]);
    // 初始化
    for (int i = 1; i <= n; i ++ )
        for (int j = 0; j <= i + 1; j ++ )
            f[j] = -INF;
    f[1] = a[1][1];
    
    for (int i = 2; i <= n; i ++ )
        for (int j = i; j >= 1; j -- )
            f[j] = max(f[j - 1], f[j]) + a[i][j];
    int res = -INF;
    for (int i = 1; i <= n; i ++ )
        res = max(res, f[i]);
    cout << res << endl;
    return 0;
}

解法三(二维逆序):

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 510, INF = 0x3f3f3f3f;


int f[N][N];

int n;
int a[N][N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= i; j ++ )
            scanf("%d", &a[i][j]);
    // 逆序(自底向上)
    for (int i = n; i >= 1; i -- )
        for (int j = i; j >= 1; j -- )
            // 正下方来的，右下方来的
            f[i][j] = max(f[i + 1][j], f[i + 1][j + 1]) + a[i][j];
            
    cout << f[1][1] << endl;
    return 0;
}

解法四(一维逆序):

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 510, INF = 0x3f3f3f3f;


int f[N];

int n;
int a[N][N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= i; j ++ )
            scanf("%d", &a[i][j]);
    // 逆序(自底向上)
    for (int i = n; i >= 1; i -- )
        for (int j = 1; j <= i; j ++ )
            // 正下方来的，右下方来的
            f[j] = max(f[j], f[j + 1]) + a[i][j];
            
    cout << f[1] << endl;
    return 0;
}

---

四、其它题解

AcWing 898. 数字三角形