题目链接:https://vjudge.net/problem/53356/origin
DP
#include<bits/stdc++.h>
using namespace std;#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=5e3+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);
}
int n,m,k;
ll a[maxn],dp[maxn][maxn];
int main(){a[0]=0;cin>>n>>m>>k;rep(i,1,n+1){cin>>a[i];a[i]+=a[i-1];}ll ans=0;mst(dp[0],0);///dp[0][0]=0;rep(i,1,n+1) rep(j,0,k+1){dp[i][j]=dp[i-1][j];if(i>=m&&j>=1)dp[i][j]=max(dp[i][j],dp[i-m][j-1]+a[i]-a[i-m]);}rep(i,1,n+1) ans=max(ans,dp[i][k]);cout<<ans<<endl;return 0;
}