# Submit Info #2650

Problem Lang User Status Time Memory
Static RMQ cpp (anonymous) AC 1212 ms 16.30 MiB

ケース詳細
Name Status Time Memory
example_00 AC 5 ms 0.62 MiB
max_random_00 AC 1180 ms 16.25 MiB
max_random_01 AC 1198 ms 16.26 MiB
max_random_02 AC 1199 ms 16.25 MiB
max_random_03 AC 1212 ms 16.30 MiB
max_random_04 AC 1186 ms 16.22 MiB
random_00 AC 971 ms 14.63 MiB
random_01 AC 995 ms 15.67 MiB
random_02 AC 743 ms 4.34 MiB
random_03 AC 185 ms 15.20 MiB
random_04 AC 290 ms 12.88 MiB

#include <bits/stdc++.h> using namespace std; using ll = long long; using Edge = pair<int, int>; using Graph = vector<vector<Edge>>; #define REP(i, n) for (int i = 0; i < (n); ++i) #define SORT(v) sort((v).begin(), (v).end()) #define RSORT(v) sort((v).rbegin(), (v).rend()) const ll MOD = 1000000007; const ll nmax = 8; const ll INF = INT_MAX; bool graph[nmax][nmax]; vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF)); struct SegmentTree { private: ll n; vector<ll> node; public: SegmentTree(vector<ll> v) { ll sz = v.size(); n = 1; while (n < sz) { n *= 2; } node.resize(2 * n - 1, INF); for (ll i = 0; i < sz; i++) { node[i + n - 1] = v[i]; } for (ll i = n - 2; i >= 0; i--) { node[i] = min(node[2 * i + 1], node[2 * i + 2]); } } void update(ll x, ll val) { x += (n - 1); node[x] = val; while (x > 0) { x = (x - 1) / 2; node[x] = min(node[2 * x + 1], node[2 * x + 2]); } } // findは半開区間で考える ll find(ll a, ll b, ll k = 0, ll l = 0, ll r = -1) { if (r < 0) r = n; if (r <= a || b <= l) return INF; if (a <= l && r <= b) return node[k]; ll vl = find(a, b, 2 * k + 1, l, (l + r) / 2); ll vr = find(a, b, 2 * k + 2, (l + r) / 2, r); return min(vl, vr); } }; void warshall_floyd(ll n) { for (size_t i = 0; i < n; i++) { for (size_t j = 0; j < n; j++) { for (size_t k = 0; k < n; k++) { dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]); } } } } class UnionFind { public: vector<ll> Parent; UnionFind(ll N) { Parent = vector<ll>(N, -1); } ll find(ll A) { if (Parent[A] < 0) return A; return Parent[A] = find(Parent[A]); } ll size(ll A) { return -Parent[find(A)]; } bool Union(ll A, ll B) { A = find(A); B = find(B); if (A == B) { return false; } if (size(A) < size(B)) swap(A, B); Parent[A] += Parent[B]; Parent[B] = A; return true; } }; ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; } ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); } ll powMod(ll a, ll p) { if (p == 0) { return 1; } else if (p % 2 == 0) { ll half = powMod(a, p / 2); return mulMod(half, half); } else { return mulMod(powMod(a, p - 1), a); } } ll ceil(ll a, ll b) { return (a + b - 1) / b; } int main() { long long n, q; cin >> n >> q; vector<ll> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } SegmentTree seg = SegmentTree(a); for (int i = 0; i < q; i++) { int x, y; cin >> x >> y; cout << seg.find(x, y) << endl; } return 0; }