这测试点太水了扒

#include <bits/stdc++.h> using namespace std; int n,a[1002],i,j,ans,p; int main() { cin >> n; for (i = n; i; i--) { for (j = i; j <= n; j++) { cin >> p; a[j] = max(a[j],a[j + 1]) + p; } } for (i = 1; i <= n; i++) ans = max(ans,a[i]); cout << ans; return 0; }

#include <iostream> #include <algorithm> #include <cstdio> #include <cstring> #include <iomanip> #include <map> #include <set> #include <stack> #include <vector> #include <bits/stdc++.h> #include <cstdlib> using namespace std; const int MAXN=1005; int A[MAXN][MAXN],F[MAXN][MAXN],N; int main(){ cin>>N; for(int i=1;i<=N;i) for(int j=1;j<=i;j) cin>>A[i][j]; // cout <<"----"; F[1][1]=A[1][1]; for(int i=2;i<=N;++i) for(int j=1;j<=i;++j) F[i][j]=max(F[i-1][j-1],F[i-1][j])+A[i][j]; int ans=0; for(int i=1;i<=N;++i) ans=max(ans,F[N][i]); cout<<ans<<endl; return 0; }