mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-25 20:52:27 +00:00
26 lines
558 B
C++
26 lines
558 B
C++
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
int main() {
|
|
int n, a[1005][1005], f[1005][1005];
|
|
cin >> n;
|
|
for (int i = 1; i <= n; i++) {
|
|
for (int j = 1; j <= i; j++) {
|
|
cin >> a[i][j];
|
|
}
|
|
}
|
|
f[1][1] = a[1][1];
|
|
for (int i = 1; i <= n; i++) {
|
|
for (int j = 1; j <= i + 1; j++) {
|
|
f[i][j] = a[i][j] + max(f[i - 1][j], f[i - 1][j - 1]);
|
|
}
|
|
}
|
|
int ans = -0x3f3f3f;
|
|
for (int i = 1; i <= n; i++) {
|
|
ans = max(ans, f[n][i]);
|
|
}
|
|
cout << ans << endl;
|
|
return 0;
|
|
}
|