[DP] number triangle

https://www.acwing.com/problem/content/900/

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;

const int N=1100;

int v[N][N];
int f[N][N];

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

    }
    cout<<f[1][1];

    return 0;
}