ACcode
#include<bits/stdc++.h>
using namespace std;
const int M = 1e3 + 9;
int dp[M];
int main()
{
int n;cin >> n;
int p;
for (int i = n;i >= 1;i--) {
for (int j = i;j <= n;j++) {
cin >> p;
dp[j] = max(dp[j], dp[j+1]) + p;
}
}
int ans = -1;
for (auto x : dp)ans = max(x, ans);
cout << ans;
return 0;
}
![<span style='color:red;'>洛</span><span style='color:red;'>谷</span> <span style='color:red;'>P</span><span style='color:red;'>1217</span> [USACO1.5] 回文质数 Prime Palindromes 刷题笔记](https://img-blog.csdnimg.cn/direct/f91b8b119a77441eb95812d4eed84a4e.png)
