怎么优化啊+-*/C++

Question

这怎么优化啊

#include <bits/stdc++.h>
using namespace std;
int a[105][105],n;
int f(int i,int j)
{
    if(i==n)
        return a[i][j];
    return a[i][j]+max(f(i+1,j),f(i+1,j+1));
}
int main() {
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=i; j++)
        {
            cin>>a[i][j];
        }
    }
    cout<<f(1,1);
    return 0;
}

Answer 1

```c++
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 105;
int a[MAXN][MAXN], dp[MAXN][MAXN], 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++) {
            dp[i][j] = a[i][j] + max(dp[i + 1][j], dp[i + 1][j + 1]);
        }
    }

    cout << dp[1][1];

    return 0;
}

```