【单调队列优化dp】第五届武汉纺织大学ACM程序设计竞赛

题目

#include<bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
const int maxn = 1e6 + 5, inf = 1e9, mod = 998244353, N = 2e5;

int a[maxn];

void solve(){
	int res = 0;
	int n, k, q;
	cin >> n;
	cin >> k >> q;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}

    auto calc = [&]() -> vector<int> {
        deque<int> dq;
        vector<int> f(n + 5);
        dq.pb(1);
        f[1] = a[1];
        for(int i = 2; i <= n; i++){
            while(!dq.empty() && dq.front() < i - k){
                dq.pop_front();
            }
            int tmp =