[算法]动态规划解决数塔问题

#include <iostream>

using namespace std;
const int N = 50;

void dataTower(int data[][N], int n) {
    int r[n][N] = {0};// 每阶段路径计算结果
    int i, j;
    int path[n][N] = {0};// 下一步最优节点列坐标
    for (i = 1; i < n; i++)
        r[n - 1][i] = data[n - 1][i];// 最底层初始化
    /*动态规划部分*/
    for (i = n - 2; i > 0; i--) {// 从倒数第二层到第一层
        for (j = 1; j <= i; j++) {// 从左到右遍历一层的所有元素
            if (r[i + 1][j] > r[i + 1][j + 1]) {// 左下角元素>右下角元素
                r[i][j] = r[i + 1][j] + data[i][j];
                path[i][j] = 0;
            } else {
                r[i][j] = r[i + 1][j + 1] + data[i][j];
                path[i][j] = 1;
            }
        }
    }
    j = 1;
    cout << "The max value of the tower is :" << r[1][1] << endl;
    for (i = 1; i < n - 1; i++) {
        cout << data[i][j] << "--";
        j += path[i][j];
    }
    cout << data[i][j] << endl;


}

int main() {
    int data[][N] = {};
    int n;
    dataTower(data, n);
    return 0;
}