verify/LC-StaticRMQ(SegmentTree).test.cpp

View this file on GitHub
Last update: 2022-12-18 04:16:09+09:00
Problem: https://judge.yosupo.jp/problem/staticrmq
Link: View error logs on GitHub Actions

Depends on

Code

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

#include "../template/template.hpp"
#include "../data-structure/segment-tree/range-minimum-query.hpp"

int main(){
  int N, Q;
  cin >> N >> Q;
  VI a = input(N);
  RangeMinimumQuery rmq(N);
  REP(i,N) rmq.update(i, a[i]);
  REP(i,Q){
    int l, r;
    cin >> l >> r;
    cout << rmq.query(l, r) << '\n';
  }
}

#line 1 "verify/LC-StaticRMQ(SegmentTree).test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"

#line 1 "template/template.hpp"
#include<bits/stdc++.h>
using ll = long long;
#define REP(i, n) for(ll i = 0; (i) < ll(n); ++ (i))
#define FOR(i, m, n) for(ll i = (m); (i) <= ll(n); ++ (i))
#define REPR(i, n) for(ll i = ll(n) - 1; (i) >= 0; -- (i))
#define FORR(i, m, n) for(ll i = ll(n); (i) >= ll(m); -- (i))
#define ALL(x) x.begin(),x.end()

#define INF (int)1e9
#define LLINF (long long)1e18
#define MOD (int)(1e9+7)
#define MOD9 (int)998244353
#define PI 3.141592653589
#define PB push_back
#define F first
#define S second

#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define Yes(T) {cout<<"Yes"<<endl; if(T) return 0;}
#define No(T) {cout <<"No"<<endl; if(T) return 0;}
#define YES(T) {cout<<"YES"<<endl; if(T) return 0;}
#define NO(T) {cout <<"NO"<<endl; if(T) return 0;}

#define Graph vector<vector<int> >
#define CostGraph vector<vector<pair<int,ll> > >
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define VI vector<int>
#define VL vector<ll>
#define VVI vector<vector<int> >
#define VVL vector<vector<ll> >
#define VPII vector<pair<int,int> >
#define VPLL vector<pair<ll,ll> >

#define DDD fixed<<setprecision(10)
#define PAD setfill('0')<<right<<setw(8)

template <class T>
inline bool chmin(T &a, T b) {
  if(a > b){ a = b; return true;}
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if(a < b){a = b; return true;}
  return false;
}
struct input{
  int n;
  input() {}
  input(int n_) : n(n_){};
  template <class T>
  operator T(){
    T ret;
    std::cin >> ret;
    return ret;
  }
  template <class T>
  operator std::vector<T>() {
    std::vector<T> ret(n);
    REP(i,n) std::cin >> ret[i];
    return ret;
  }
};
template <class T>
inline void printVec(std::vector<T> v){
  REP(i,v.size()){
    if(i) std::cout << " ";
    std::cout << v[i];
  } std::cout << std::endl;
}

using namespace std;
#line 1 "data-structure/segment-tree/segment-tree.hpp"
template <typename T>
struct SegmentTree{
  using F = function<T(T, T)>;
  int sz;
  vector<T> seg;

  const F f;
  const T e;

  SegmentTree(int n, const F f, const T &e): f(f), e(e){
    sz = 1;
    while(sz < n) sz <<= 1;
    seg.assign(2 * sz, e);
  }

  void set(int k, const T &x){
    seg[k+sz] = x;
  }

  void build(){
    for(int k = sz - 1; k > 0; --k){
      seg[k] = f(seg[2*k+0], seg[2*k+1]);
    }
  }

  void update(int k, const T &x){
    k += sz;
    seg[k] = x;
    while(k >>= 1){
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  T query(int a, int b){
    T l = e, r = e;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1){
      if(a & 1) l = f(l, seg[a++]);
      if(b & 1) r = f(seg[--b], r);
    }
    return f(l, r);
  }

  T operator[](const int &k) const{
    return seg[k + sz];
  }

  template <typename C>
  int findSubtree(int a, const C &check, T &m, bool type){
    while(a < sz){
      T nxt = type ? f(seg[2 * a + type], m): f(m, seg[2 * a + type]);
      if(check(nxt)) a = 2 * a + type;
      else m = nxt, a = 2 * a + 1 - type;
    }
    return a - sz;
  }

  template<typename C>
  int findFirst(int a, const C &check){
    T l = e;
    if(a <= 0){
      if(check(f(l, seg[1]))) return findSubtree(1, check, l, false);
      return -1;
    }
    int b = sz;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1){
      if(a & 1) {
        T nxt = f(l, seg[a]);
        if(check(nxt)) return findSubtree(a, check, l, false);
        l = nxt;
        ++a;
      }
    }
    return -1;
  }

  template <typename C>
  int findLast(int b, const C &check){
    T r = e;
    if(b >= sz) {
      if(check(f(seg[1], r))) return findSubtree(1, check, r, true);
      return -1;
    }
    int a = sz;
    for(b += sz; a < b; a >>= 1, b >>= 1){
      if(b & 1){
        T nxt = f(seg[--b], r);
        if(check(nxt)) return findSubtree(b, check, r, true);
        r = nxt;
      }
    }
    return -1;
  }
};
#line 2 "data-structure/segment-tree/range-minimum-query.hpp"
struct RangeMinimumQuery{
  int n;
  SegmentTree<ll> seg;
  RangeMinimumQuery(int n): n(n), seg(n, [&](ll l, ll r){
    return min(l, r);
  }, LLONG_MAX){

  }

  void update(int k, int val){
    seg.update(k, val);
  }

  ll query(int l, int r){
    return seg.query(l, r);
  }
};
#line 5 "verify/LC-StaticRMQ(SegmentTree).test.cpp"

int main(){
  int N, Q;
  cin >> N >> Q;
  VI a = input(N);
  RangeMinimumQuery rmq(N);
  REP(i,N) rmq.update(i, a[i]);
  REP(i,Q){
    int l, r;
    cin >> l >> r;
    cout << rmq.query(l, r) << '\n';
  }
}