向量解法

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

struct ve{
    vector<int>s;
};

int main(){
    int n,tmp;
    cin >> n;
    ve nums[n];
    for(int i = 0;i<n;i++){
        for(int j = 0;j<i+1;j++){
            cin >> tmp;
            nums[i].s.push_back(tmp);
        }
    }
    for(int i = n-2;i>=0;i--){
        //cout<<i<<endl;
        for(int j = 0;j<i+1;j++){
            //cout<<nums[i].s[j]<<' '<<nums[i+1].s[j]<<' '<<nums[i+1].s[j+1]<<endl;
            nums[i].s[j] += max(nums[i+1].s[j],nums[i+1].s[j+1]);    
        }
    }
    cout<<nums[0].s[0];
}