Codeforces 467C. George and Job
DP....
/** * Created by ckboss on 14-9-19. */ import java.util.*; public class GeorgeandJob { static int n,m,k; static long[] a = new long[5050]; static long[] sum = new long[5050]; static long[][] dp = new long[5050][3]; public static void main(String[] args){ Scanner in = new Scanner(System.in); n=in.nextInt(); m=in.nextInt(); k=in.nextInt(); for(int i=1;i<=n;i++){ a[i]=in.nextInt(); sum[i]=sum[i-1]+a[i]; } for(int i=m;i<=n;i++){ dp[i][1]=Math.max(dp[i-1][1],sum[i]-sum[i-m]); } for(int j=2;j<=k;j++){ for(int i=j*m;i<=n;i++){ dp[i][j%2]=Math.max(dp[i-m][(j-1)%2]+sum[i]-sum[i-m],dp[i-1][j%2]); } } long ans=0; for(int i=k*m;i<=n;i++){ ans=Math.max(ans,dp[i][k%2]); } System.out.println(ans); } }