(linear DP) acwing 898 Number triangle

898. Digital triangle

Topic link https://www.acwing.com/problem/content/900/
subject ：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>

using namespace std;
int a[500][500];
int main(){
    
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
    
        for(int j=1;j<=i;j++)
            scanf("%d",&a[i][j]);
    }
    for(int i=n-1;i>=1;i--){
    
        for(int j=1;j<=i;j++){
    
            a[n][j]=a[i][j]+max(a[n][j],a[n][j+1]);
        }
        
    }
    cout<<a[n][1];
    return 0;
}