【基础】1216 - 数塔问题

#include<bits/stdc++.h>
using  namespace std;
const int N = 1e2 + 10;
int n, a[N][N];
int dfs(int d) {
	for (int i = 1; i <= d; i++) {
		for (int j = 1; j <= i; j++) cin >> a[i][j];
	}
	for (int i = n - 1; i >= 1; i--) {
		for (int j = 1; j <= i; j++) {
			a[i][j] += max(a[i + 1][j], a[i + 1][j + 1]);
		}
	}
	return d;
}
int main() {
	cin >> n;
	dfs(n);
	cout << a[1][1];
	return 0;
}

创作不易，勿喷！！！

AC嘻嘻