很水的dp 拿来练手的
#include <iostream>
const int maxn=360;
int dp[maxn][maxn];
int arr[maxn][maxn];
int N;
using namespace std;
int main() {
//freopen("in","r",stdin);
//freopen("out","w",stdout);
while(cin>>N){
//memset(dp,-1, sizeof(dp));
for(int i=1;i<=N;i++){
for(int j=1;j<i+1;j++){
cin>>arr[i][j];
}
}
for(int i=0;i<=N;i++)
dp[N][i]=arr[N][i];
for(int i=N;i>=0;i--){
for(int j=0;j<=N;j++){
dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+arr[i][j];
}
}
cout<<dp[0][0]<<endl;
}
return 0;
}