Problem 18 数塔最大路径和

75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23

1 从上往下算：
正上方和左上方路径和：ans[i][j] = ans[i-1][j-1] + ans[i-1][j] + num[i][j]

#include <iostream>
using namespace std;

int num[20][20], n = 15;

int main() {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= i; j++) {
			cin >> num[i][j];
		}
	}
	int ans = 0;
	for (int i = 2; i <= n; i++) {
		for (int j = 1; j <= i; j++) {
			num[i][j] += max(num[i - 1][j - 1], num[i - 1][j]);
			ans = max(ans, num[i][j]);
		}
	}
	cout << ans << endl;

	return 0;
}

2 从下往上算：
正下方和右下方路径和：ans[i][j] = ans[i+1][j+1] + ans[i+1][j] + num[i][j]

#include <iostream>
using namespace std;

int num[20][20], n = 15;

int main() {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= i; j++) {
			cin >> num[i][j];
		}
	}
	for (int i = n - 1; i > 0; i--) {
		for (int j = 1; j <= i; j++) {
			num[i][j] += max(num[i + 1][j + 1], num[i + 1][j]);
		}
	}
	cout << num[1][1] << endl;

	return 0;
}

复杂度都是O(n2)
结果为:1074