具体代码如下
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int N = 1000010;
int n, m;
int a[N], f[N], last[N];
int main(){
while(~scanf("%d%d", &m, &n)){
for(int i = 1; i <= n; ++ i) scanf("%d", &a[i]);
memset(f, 0, sizeof f);
memset(last, 0, sizeof last);
int temp;
for(int i = 1; i <= m; ++ i){
temp = -2e9;
for(int j = i; j <= n; ++ j){
f[j] = max(f[j - 1], last[j - 1]) + a[j];
last[j - 1] = temp;
temp = max(temp, f[j]);
}
}
printf("%d\n", temp);
}
return 0;
}