Max Sum Plus Plus
code
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ill = __int128;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = ll(1e8 + 7);
const ll INF = ll(1e18 + 10);
const int N = int(1e6 + 20);
const int M = int(300 * 2 * 666 + 10);
inline int rnd(){static int seed=2333;return seed=(((seed*666666ll+20050818)%998244353)^1000000007)%1004535809;}
template <class T> void read(T &x) {
static char ch;static bool neg;
for(ch=neg=0;ch<'0' || '9'<ch;neg|=ch=='-',ch=getchar());
for(x=0;'0'<=ch && ch<='9';(x*=10)+=ch-'0',ch=getchar());
x=neg?-x:x;
}
ll add(ll a, ll b) {
return (a + b) % MOD;
}
ll sub(ll a, ll b) {
return (a - b + MOD) % MOD;
}
ll mul(ll a, ll b) {
a %= MOD; b %= MOD;
return a * b % MOD;
}
int n, m;
ll dp[N], res;
void solve() {
while(cin >> m >> n){
memset(dp, 0, sizeof(int) * (n + 10));
vector<ll> a(n + 1), maxx(n + 1);
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= m; ++ i) {
res = -INF;
for(int j = i; j <= n; ++ j) {
dp[j] = max(maxx[j - 1] + a[j], dp[j - 1] + a[j]);
maxx[j - 1] = res;
res = max(res, dp[j]);
}
}
cout << res << endl;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifdef ACM_LOCAL
freopen("input", "r", stdin);
signed test_index_for_debug = 1;
char acm_local_for_debug = 0;
do {
if (acm_local_for_debug == '$') exit(0);
if (test_index_for_debug > 20)
throw runtime_error("Check the stdin!!!");
auto start_clock_for_debug = clock();
solve();
auto end_clock_for_debug = clock();
cout << "Test " << test_index_for_debug << " successful" << endl;
cerr << "Test " << test_index_for_debug++ << " Run Time: "
<< double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
cout << "--------------------------------------------------" << endl;
} while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
solve();
#endif
return 0;
}