Misc/Deque.h

• View this file on GitHub
• Last update: 2025-06-11 15:37:14+07:00

Depends on

• template.h

Code

#include "../template.h"

vector<int> maxRange(const vector<int>& a, int k) {
    deque<int> dq;
    vector<int> res;
    for(size_t i = 0; i < a.size(); i++) {
        while(!dq.empty() && a[dq.back()] <= a[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        if(dq.front() + k <= i) dq.pop_front();
        if(i >= k-1) res.push_back(a[dq.front()]);
    }
    return res;
}

vector<int> minRange(const vector<int>& a, int k) {
    deque<int> dq;
    vector<int> res;
    for(size_t i = 0; i < a.size(); i++) {
        while(!dq.empty() && a[dq.back()] >= a[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        if(dq.front() + k <= i) dq.pop_front();
        if(i >= k-1) res.push_back(a[dq.front()]);
    }
    return res;
}

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 2 "Misc/Deque.h"

vector<int> maxRange(const vector<int>& a, int k) {
    deque<int> dq;
    vector<int> res;
    for(size_t i = 0; i < a.size(); i++) {
        while(!dq.empty() && a[dq.back()] <= a[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        if(dq.front() + k <= i) dq.pop_front();
        if(i >= k-1) res.push_back(a[dq.front()]);
    }
    return res;
}

vector<int> minRange(const vector<int>& a, int k) {
    deque<int> dq;
    vector<int> res;
    for(size_t i = 0; i < a.size(); i++) {
        while(!dq.empty() && a[dq.back()] >= a[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        if(dq.front() + k <= i) dq.pop_front();
        if(i >= k-1) res.push_back(a[dq.front()]);
    }
    return res;
}

Back to top page