You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
18 lines
449 B
18 lines
449 B
#include <bits/stdc++.h>
|
|
using namespace std;
|
|
const int N = 1e4 + 10;
|
|
int n, a[N][N];
|
|
int f[N][N];
|
|
int main() {
|
|
cin >> n;
|
|
for (int i = 1; i <= n; i++)
|
|
for (int j = 1; j <= i; j++)
|
|
cin >> a[i][j];
|
|
|
|
for (int i = n; i >= 1; i--) // 从下向上去递推
|
|
for (int j = 1; j <= i; j++)
|
|
f[i][j] = max(f[i + 1][j], f[i + 1][j + 1]) + a[i][j];
|
|
|
|
printf("%d\n", f[1][1]);
|
|
return 0;
|
|
} |