很经典的DP
#include<cstdio>
#include<cmath>
#include<iostream>
#define LL __int64
#define INF 1000000000000000LL
const int nsize=1111111;
int a[nsize];
LL dp[2][nsize];
LL Max(LL a1,LL a2)
{
return a1>a2?a1:a2;
}
void Swap(int *a1,int *a2)
{
int t=*a1;
*a1=*a2;
*a2=t;
}
LL MaxSum(int n,int m,int *a)
{
int i,j,cur=0,pre=1;
LL ans;
if (n<m||m<1) return 0;
for (j=0; j<=n; j++) dp[0][j]=dp[1][j]=0;
for (i=1; i<=m; i++)
{
Swap(&cur,&pre);
dp[cur][i]=dp[pre][i-1]+a[i];
ans=dp[pre][i-1];
for (j=i+1; j<=n-m+i; j++)
{
ans=Max(ans,dp[pre][j-1]);
dp[cur][j]=Max(dp[cur][j-1],ans)+a[j];
}
}
for (ans=-INF,i=m; i<=n; i++)
ans=Max(ans,dp[cur][i]);
return ans;
}
int main()
{
int n,m;
while (~scanf("%d %d",&m,&n))
{
for (int i=1; i<=n; i++) scanf("%d",a+i);
printf("%I64d\n",MaxSum(n,m,a));
}
return 0;
}