1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
| #include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int a[N][N], f[N][N];
int 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 = 1; i <= n; i ++ ) f[n][i] = w[n][i];
for (int i = n - 1; i > 0; i ++ )
for (int j = 1; j <= i; j ++ )
f[i][j] = max(f[i + 1][j], f[i + 1][j + 1]);
int res = -2e9;
for (int i = 1; i <= n; i ++ ) res = max(res, f[n][i]);
cout << res << endl;
return 0;
}
|
