AcWing 1087 修剪草坪 题解（动态规划—DP—单调队列优化DP）

推公式的DP
AcWing 1087 修剪草坪

#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N = 1e5 + 10;

int a[N];
int f[N];
int s[N];
int q[N];

int g(int i){
	if(!i) return 0;
	return f[i - 1] - s[i];
}

int n, m;

signed main()
{
	cin>>n>>m;
	for(int i = 1; i <= n; i ++ ){
		cin>>a[i];
		s[i] = s[i - 1] + a[i];
	}
	
	int hh = 0, tt = 0;
	for(int i = 1; i <= n; i ++ ){
		if(q[hh] < i - m) hh ++ ;
		f[i] = max(f[i - 1], g(q[hh]) + s[i]);
		while(tt >= hh && g(q[tt]) <= g(i)) tt -- ;
		q[ ++ tt ] = i;
	}
	
	cout<<f[n]<<endl;
	return 0;
}