DataStructure/Static_RMQ.test.cpp

• View this file on GitHub
• Last update: 2025-06-11 15:37:14+07:00
• Problem: https://judge.yosupo.jp/problem/staticrmq

Depends on

• DataStructure/RMQ/RMQ.h
• template.h

Code

#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"

#include "../template.h"
#include "RMQ/RMQ.h"

void solve() {
    int n, q; cin >> n >> q;
    vector<int> a(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    RMQ<int> rmq(n);
    rmq.preprocess(a);
    while (q--) {
        int l, r; cin >> l >> r;
        cout << rmq.queryMin(l+1, r) << '\n';
    }
}

#line 1 "DataStructure/Static_RMQ.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"

#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 "DataStructure/RMQ/RMQ.h"

template <typename T>
struct RMQ {
    int n;
    vector<vector<T>> mn, mx, sum;

    RMQ() {}
    RMQ(int _n): n(_n) {
        mn = mx = sum = vector<vector<T>>(20, vector<T>(_n+1));
    }

    void preprocess(vector<T> &a) {
        for (int i = 1; i <= n; i++) {
            mn[0][i] = mx[0][i] = sum[0][i] = a[i];
        }
        for (int i = 1; i < 20; i++) {
            for (int j = 1; j + (1 << i) - 1 <= n; j++) {
                mn[i][j] = min(mn[i-1][j], mn[i - 1][j + (1 << (i-1))]);
                mx[i][j] = max(mx[i-1][j], mx[i - 1][j + (1 << (i-1))]);
                sum[i][j] = sum[i-1][j] + sum[i - 1][j + (1 << (i-1))];
            }
        }
    }

    T queryMin(int l, int r) {
        int k = __lg(r-l+1);
        return min(mn[k][l], mn[k][r - (1 << k) + 1]);
    }

    T queryMax(int l, int r) {
        int k = __lg(r-l+1);
        return max(mx[k][l], mx[k][r - (1 << k) + 1]);
    }

    T querySum(int l, int r) {
        int len = r-l+1;
        T ans = 0;
        for (int i = 0; (1 << i) <= len; i++) {
            if (len >> i & 1) {
                ans += sum[i][l];
                l += (1 << i);
            }
        }
        return ans;
    }
};
#line 5 "DataStructure/Static_RMQ.test.cpp"

void solve() {
    int n, q; cin >> n >> q;
    vector<int> a(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    RMQ<int> rmq(n);
    rmq.preprocess(a);
    while (q--) {
        int l, r; cin >> l >> r;
        cout << rmq.queryMin(l+1, r) << '\n';
    }
}

Back to top page