烽火传递（单调队列）

1089. 烽火传递 - AcWing题库

#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#define x first
#define int long long
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
typedef pair<char,int> PCI;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N=2e6+10,INF = 1e9 ,mod = 1e9 + 7 ;
const double eps = 1e-7;


int n,m;
int a[N];
int q[N],f[N];
void solve()
{
    cin >> n >> m ;
    for(int i=1;i<=n ; i++ ) cin >> a[i];

    int tt=0,hh=0,res =INF ;
    for(int i=1;i <= n;i ++ )
    {
        if(hh <=tt && i - m  > q[hh] ) hh ++ ;
        f[i]= f[q[hh]] + a[i];
        while(hh <=tt  && f[q[tt]  ] >= f[i]) tt--;
// 此处 用队列来 维护 区间 最小值
        q[ ++ tt] = i;

    }

    for(int i=n- m + 1;i <=n ;i ++ ) res = min(res,f[i]);

    cout << res << endl;


}



signed main()
{
//    freopen("1.txt","r",stdin);
    ios
    LL T=1;
//    cin>>T;
    while(T -- )
    {
        solve();
    }



    return 0;
}