Codeforces ラウンド #267 (ディビジョン 2) C George と Job_html/css_WEB-ITnose

//#pragma comment(linker, "/STACK:102400000,102400000")#include <cstdio>#include <cstring>#include <algorithm>#include <string>#include <iostream>#include <iomanip>#include <cmath>#include <map>#include <set>#include <queue>using namespace std;#define ls(rt) rt*2#define rs(rt) rt*2+1#define ll long long#define ull unsigned long long#define rep(i,s,e) for(int i=s;i<e;i++)#define repe(i,s,e) for(int i=s;i<=e;i++)#define CL(a,b) memset(a,b,sizeof(a))#define IN(s) freopen(s,"r",stdin)#define OUT(s) freopen(s,"w",stdout)const ll ll_INF = ((ull)(-1))>>1;const double EPS = 1e-8;const double pi = acos(-1);const int INF = 100000000;const int MAXN = 5000+100;ll num[MAXN],dp[MAXN][MAXN],pp[MAXN];int n,m,k;ll solve(){    CL(dp,0);    for(int i=m;i<=n;i++)        for(int j=1;j<=k;j++)            dp[i][j]=max(dp[i-m][j-1]+pp[i]-pp[i-m],dp[i-1][j]);    return dp[n][k];}int main(){    //IN("C.txt");    while(~scanf("%d%d%d",&n,&m,&k))    {        pp[0]=0;        for(int i=1;i<=n;i++)        {            scanf("%I64d",&num[i]);            pp[i]=pp[i-1]+num[i];        }        printf("%I64d\n",solve());    }    return 0;}