6213번: Balanced Lineup ↗

/*
[6213: Balanced Lineup](https://www.acmicpc.net/problem/6213)

Tier: Gold 1 
Category: data_structures, segtree
*/

#include <bits/stdc++.h>

using namespace std;

#define for1(s, e) for(int i = s; i < e; i++)
#define for1j(s, e) for(int j = s; j < e; j++)
#define forEach(k) for(auto i : k)
#define forEachj(k) for(auto j : k)
#define sz(vct) vct.size()
#define all(vct) vct.begin(), vct.end()
#define sortv(vct) sort(vct.begin(), vct.end())
#define uniq(vct) sort(all(vct));vct.erase(unique(all(vct)), vct.end())
#define fi first
#define se second
#define INF (1ll << 60ll)

typedef unsigned long long ull;
typedef long long ll;
typedef ll llint;
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef ull ullint;

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<double, int> pdi;
typedef pair<string, string> pss;

typedef vector<int> iv1;
typedef vector<iv1> iv2;
typedef vector<ll> llv1;
typedef vector<llv1> llv2;

typedef vector<pii> piiv1;
typedef vector<piiv1> piiv2;
typedef vector<pll> pllv1;
typedef vector<pllv1> pllv2;
typedef vector<pdd> pddv1;
typedef vector<pddv1> pddv2;

const double EPS = 1e-8;
const double PI = acos(-1);

template<typename T>
T sq(T x) { return x * x; }

int sign(ll x) { return x < 0 ? -1 : x > 0 ? 1 : 0; }
int sign(int x) { return x < 0 ? -1 : x > 0 ? 1 : 0; }
int sign(double x) { return abs(x) < EPS ? 0 : x < 0 ? -1 : 1; }

struct Node {
  ll mx = -INF, mn=INF;
};

struct SegTree {
  ll n;
  llv1 ar;
  vector <Node> tree;

  SegTree(ll n) {
    this->n = n;
    ar.resize(n + 1);
    tree.resize(4 * n + 5);
  }

  void init() {
    init(1, n, 1);
  }

  void init(ll left, ll right, ll idx) {
    if(left == right) {
      tree[idx].mx = ar[left];
      tree[idx].mn = ar[left];

      return;
    }

    ll mid = (left + right) / 2;

    init(left, mid, idx * 2);
    init(mid + 1, right, idx * 2 + 1);

    Node l = tree[idx * 2];
    Node r = tree[idx * 2 + 1];

    tree[idx] = {max(l.mx, r.mx),min(l.mn, r.mn)};
  }

  Node query(ll left, ll right, ll idx, ll start, ll end) {
    if(right < start || end < left) return {-INF, INF};

    if(start <= left && right <= end) return tree[idx];

    ll mid = (left + right) / 2;

    Node left_ret = query(left, mid, idx * 2, start, end);
    Node right_ret = query(mid + 1, right, idx * 2 + 1, start, end);

    return {max(left_ret.mx, right_ret.mx), min(left_ret.mn, right_ret.mn)};
  }

  Node query(ll start, ll end) {
    return query(1, n, 1, start, end);
  }
};

void solve() {
  ll N, Q;
  cin >> N >> Q;

  SegTree tree(N);

  for1(1, N + 1) {
    cin >> tree.ar[i];
  }

  tree.init();

  for1(0, Q) {
    ll a, b;
    cin >> a >> b;
    Node ret = tree.query(a, b);

    cout << ret.mx - ret.mn << "\n";
  }
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);cout.tie(NULL);
  int tc = 1; // cin >> tc;
  while(tc--) solve();

}