Yet Another Subarray Problem Codeforces Round 69 dp

最新推荐文章于 2021-10-22 18:05:43 发布

mizp

最新推荐文章于 2021-10-22 18:05:43 发布

阅读量189

点赞数

分类专栏： codeforces DP

本文链接：https://blog.csdn.net/qq_42819598/article/details/96983653

版权

codeforces 同时被 2 个专栏收录

28 篇文章 0 订阅

订阅专栏

26 篇文章 0 订阅

订阅专栏

链接: http://codeforces.com/contest/1197/problem/D
题面:
You are given an array a1,a2,…,an and two integers m and k.

You can choose some subarray al,al+1,…,ar−1,ar.

The cost of subarray al,al+1,…,ar−1,ar is equal to $∑_{i=l}^{r}a_{i}−k⌈\frac{(r−l+1)}m⌉$ , where ⌈x⌉ is the least integer greater than or equal to x.

The cost of empty subarray is equal to zero.
Your task is to find the maximum cost of some subarray (possibly empty) of array a.
题意: 找出一段区间使得 $∑_{i=l}^{r}a_{i}−k⌈\frac{(r−l+1)}m⌉$ 最大，区间长度可以为0，即不选
思路: dp[ i ]为前i个能得到的最大值，每m个减去k

#include<bits/stdc++.h>
using namespace std;
const int N=3e5+5;
typedef long long ll;
ll a[N];
ll dp[N];
int main()
{
	int n,m,k;
	ll ans=0;
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		dp[i]=max(a[i]-k,dp[i]);
		a[i]+=a[i-1];
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(i-j>=0)
			{
				dp[i]=max(dp[i],dp[i-j]-k+a[i]-a[i-j]);
				ans=max(ans,dp[i]);
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}