CF 267C George and Job

最新推荐文章于 2022-02-15 17:15:25 发布

Liao_Jingyi

最新推荐文章于 2022-02-15 17:15:25 发布

阅读量706

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/Liao_Jingyi/article/details/39407431

版权

动态规划专栏收录该内容

39 篇文章 0 订阅

订阅专栏

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 p₁, p₂, ..., p_n. You are to choose k pairs of integers:

[l₁, r₁], [l₂, r₂], ..., [l_k, r_k] (1 ≤ l₁ ≤ r₁ < l₂ ≤ r₂ < ... < l_k ≤ r_k ≤ n; r_i - l_i + 1 = m),

in such a way that the value of sum $\text{[math]}$ 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 p₁, p₂, ..., p_n (0 ≤ p_i ≤ 10⁹).

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

Input

7 1 3
2 10 7 18 5 33 0

Output

解析

动态规划，dp[i][j]表示在前k个数中找i组数能得到的最大和。有两种情况，要么最优策略中的最后一组数是以p_j结尾的（ dp[ i ] [ j ] = dp[ i-1 ] [ j-m+1 ] + sigma( j-m+1 , j ) ），要么最优策略中的最后一组数不是以p_j结尾的（dp [ i ] [ j ] = dp [i] [j-1]）。所以dp[ i ] [ j ] = max ( dp[ i ] [ j-1 ] , dp[ i-1 ] [ j-M ] + sigma( j-M+1 , j ) );

#include<cstdio>
#include<algorithm>
#include<cstring>

using namespace std;

typedef unsigned long long LL;

int N,M,K,p[5010];
LL dp[5010][5010];

inline LL sigma(int a,int b)
{
	LL sum=0;
	for(int i=a;i<=b;i++) sum+=p[i];
	return sum;
}

inline void readdata()
{
	memset(dp,0,sizeof(dp));
	for(int i=1;i<=N;i++) scanf("%d",&p[i]);
}

void DP()
{
	for(int i=1;i<=K;i++)
		for(int j=M;j<=N;j++)
			dp[i][j]=max(dp[i][j-1],dp[i-1][j-M]+sigma(j-M+1,j));
	printf("%I64d\n",dp[K][N]);
}

int main()
{
	//freopen("C.in","r",stdin);

	while(scanf("%d%d%d",&N,&M,&K)==3)
	{
		readdata();
		DP();
	}

	//while(1);
	return 0;
}