复习

/*
 * @Author: YMYS
 * @Date: 2024-02-25 21:38:22
 * @LastEditTime: 2024-12-16 21:08:49
 * @FilePath: \VScode-C&C++-Coding\z_demo\easy.cpp
 * @URL:
 * @Description: 
 */
#include<bits/stdc++.h>

using namespace std;

const int N = 510;

// int T;
// void solve(){

// }

int n, f[N][N], dp[N][N];

int main()
{
#ifdef ABC
    freopen("D:\\daily_Coding\\VScode-C&C++-Coding\\in.in", "r", stdin);
    freopen("D:\\daily_Coding\\VScode-C&C++-Coding\\out.out", "w", stdout);
#endif
    // cin>>T;
    // while(T--){
    //     solve();
    // }

    cin>>n;

    for(int i=1;i<=n;i++){
        for(int j=1;j<=i;j++){
            cin>>f[i][j];
        }
    }

    for(int i=1;i<=n;i++){
        dp[n][i] = f[n][i];
    }

    for(int i=n-1;i>=1;i--){
        for(int j=1;j<=i;j++){
            dp[i][j] = max(dp[i+1][j], dp[i+1][j+1]) + f[i][j];
        }
    }

    cout<<dp[1][1]<<endl;

    return 0;
}