#include<cstdio>
#include<algorithm>
using namespace std;
int N, dp[351][351];
int main() {
    scanf("%d", &N);
    for (int i = 1; i <= N; i++)
        for (int j = 1; j <= i; j++) {
            scanf("%d", &dp[i][j]);
            dp[i][j] = dp[i][j] + max(dp[i - 1][j], dp[i - 1][j - 1]);
        }
    printf("%d\n", *(max_element(dp[N], dp[N] + N + 1)) );
    return 0;
}

• Re:14行代码 (9) algoriiiiithm 2020-12-28 19:54:33