Codeforces 467 C. George and Job

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The new ITone 6 has been released recently and George got really keen to buy it. Unfortunately, he didn't have enough money, so George was going to work as a programmer. Now he faced the following problem at the work.

Given a sequence of n integers p1, p2, ..., pn. You are to choose k pairs of integers:

[l1, r1], [l2, r2], ..., [lk, rk] (1 ≤ l1 ≤ r1 < l2 ≤ r2 < ... < lk ≤ rk ≤ n; ri - li + 1 = m), 

in such a way that the value of sum  is maximal possible. Help George to cope with the task.

Input

The first line contains three integers n, m and k (1 ≤ (m × k) ≤ n ≤ 5000). The second line contains n integers p1, p2, ..., pn(0 ≤ pi ≤ 109).

Output

Print an integer in a single line — the maximum possible value of sum.

Sample test(s)

input

5 2 1
1 2 3 4 5

output

9

input

7 1 3
2 10 7 18 5 33 0

output

61

在走投无路的情况下，果然应该是dp，我看了标签才决定往dp一路走到黑………………

啪啪啪

又是很显然的拿不拿dp。。。。

一如既往的。。。边界问题很讨厌

发现最多递归五千层的样子，哈哈哈，记忆化搜索啪啪啪

#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#include<bitset>
#include<climits>
#include<list>
#include<iomanip>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
ll dp[5010][5010],ps[5010];
int n,m,k;
ll dfs(int i,int j)
{
	if(dp[i][j]!=-1)
		return dp[i][j];
	if(i<j*m||j==0||i==0)
		return dp[i][j]=0;
	if(i==j*m)
		return dp[i][j]=ps[i];
	return dp[i][j]=max(dfs(i-m,j-1)+ps[i]-ps[i-m],dfs(i-1,j));
}
int main()
{
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>ps[i];
		ps[i]+=ps[i-1];
	}
	memset(dp,-1,sizeof(dp));
	cout<<dfs(n,k);
}