就像是反过来的贪心

#include<bits/stdc++.h>
using namespace std;
int dp[1000005],a[1005][1005];
int n;
int main(){
    cin>>n;
    int l=1,r=n;
    for(int i=1;i<=n;i++){
        for(int j=r;j<=l+r-1;j++){
            cin>>a[i][j];
            //cout<<a[n][j]<<" ";
        }
        //cout<<endl;
        l+=2;
        r--;
    }
    l=n*2-1;r=2;
    for(int i=n-1;i>=1;i--){
        for(int j=r;j<=l+r-1;j++){
            
            a[i][j]+=min(a[i+1][j],min(a[i+1][j+1],a[i+1][j-1]));
        }
        l-=2;
        r++;
    }
    cout<<a[1][n];
    return 0;
}