洛谷 P1216 [USACO1.5][IOI1994]数字三角形 Number Triangles （尚贤）

https://www.luogu.com.cn/problem/P1216

dp 题单

#include <cstdio>
#include <iostream>
#define max(a, b) ((a > b) ? a : b)
using namespace std;
int dp[1005][1005];
int main() { 
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= i; ++j) {
			scanf("%d", &dp[i][j]);
		}
	}
	for (int i = n - 1; i >= 1; --i) {
		for (int j = 1; j <= i; ++j) {
			dp[i][j] += max(dp[i + 1][j], dp[i + 1][j + 1]);
		}
	}
	printf("%d\n", dp[1][1]);
	return 0;
}