单调队列3

P2627 [USACO11OPEN]Mowing the Lawn G

#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e4+7;
const int M=1e5;
const int N=1e5+5;//空间最大限制 4e8
int n,m;
int q[N],a[N],f[N],sum[N],d[N];
int l=0,r=1;
int qq(int i)
{
	d[i]=f[i-1]-sum[i];
	while(l<=r&&d[i]>d[q[r]])  r--;
	q[++r]=i;
	while(l<=r&&q[l]+m<i)  l++;
	return d[q[l]];
}
signed main()
{
//	ios::sync_with_stdio(false);
	cin>>n>>m;
	for(int i=1;i<=n;i++)  scanf("%lld",&a[i]),sum[i]=sum[i-1]+a[i];
	for(int i=1;i<=n;i++)  f[i]=sum[i]+qq(i);
	cout<<f[n];
    return 0;
}