The triangle

王道第246页
DFS

#include<iostream>
using namespace std;
int res=0,mat[101][101],n;
void dfs(int row, int col, int cur_sum);
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < i + 1; j++) {
			cin >> mat[i][j];
		}
	}
	dfs(0, 0, 0);
	cout << res;
	return 0;
}
void dfs(int row, int col, int cur_sum) {
	//走到mat[row][col]的位置
	if (row == n ) {
		res = cur_sum > res ? cur_sum : res;
		return;
	}
	cur_sum += mat[row][col];
	dfs(row + 1, col, cur_sum);
	dfs(row + 1, col + 1, cur_sum);
}

DP

#include<iostream>
using namespace std;
int mat[101][101],dp[101][101],n;
//dp[i][j] : 从mat[i][j]走到三角形底边的最大数据和
inline int max(int x, int y);
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < i + 1; j++) {
			cin >> mat[i][j];
			dp[i][j] = mat[i][j];
		}
	}
	for (int i = n - 2; i >= 0; i--) {
		for (int j = i ; j >= 0; j--) {
			dp[i][j] += max(dp[i + 1][j], dp[i + 1][j + 1]);
		}
	}
	cout << dp[0][0];
	return 0;
}
inline int max(int x, int y) {
	return x > y ? x : y;
}