[BZOJ 2442][Usaco2011 Open]修剪草坪：单调队列

点击这里查看原题

f[i]表示不选i且前面的都合法的最小损失，f[i]=min{f[j]+e[i]}(i-j<=k)

/*
User:Small
Language:C++
Problem No.:2442
*/
#include<bits/stdc++.h>
#define ll long long
#define inf 999999999
using namespace std;
const int M=1e5+5;
int n,e[M],h,t,k,q[M];
ll ans,mn=(ll)1<<60,f[M];
int main(){
    freopen("data.in","r",stdin);//
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
        scanf("%d",&e[i]);
        ans+=e[i];
    }
    for(int i=1;i<=n;i++){
        f[i]=f[q[h]]+e[i];
        while(h<t&&f[q[t]]>f[i]) t--;
        q[++t]=i;
        while(h<t&&q[h]<i-k) h++;
    }
    for(int i=n-k;i<=n;i++) mn=min(mn,f[i]);
    printf("%lld\n",ans-mn);
    return 0;
}