这测试点太水了扒

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

#include<bits/stdc++.h> using namespace std; int dp[105][105],a[105][105],r; int main() { cin>>r; for(int i=1;i<=r;i++) for(int j=1;j<=i;j++) cin>>a[i][j]; dp[1][1]=a[1][1]; for(int i=1;i<=r;i++) for(int j=1;j<=i;j++) { dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+a[i][j]; } int maxn=dp[r][1]; for(int i=1;i<=r;i++) { if(dp[r][i]>maxn) maxn=dp[r][i]; } cout<<maxn; return 0; }

#include <bits/stdc++.h> using namespace std; const int inf = 1e9; int a[107][107]; int dp[107][107]; int n; int main() { cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { cin >> a[i][j]; dp[i][j] = -inf; } } dp[1][1] = a[1][1]; for (int i = 1; i < n; i++) { for (int j = 1; j <= i; j++) { dp[i + 1][j] = max(dp[i + 1][j], dp[i][j] + a[i + 1][j]); dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + a[i + 1][j + 1]); } } int ans = -inf; for (int i = 1; i <= n; i++) { ans = max(ans, dp[n][i]); } cout << ans; }

#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; }