-
Notifications
You must be signed in to change notification settings - Fork 1
/
1646.cpp
56 lines (56 loc) · 1.15 KB
/
1646.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9 + 7;
int mi[1048576];
void build(int x, int l, int r) {
if (l == r) {
cin >> mi[x];
return;
}
int mid = (l + r) >> 1;
build(x<<1, l, mid);
build(x<<1|1, mid + 1, r);
mi[x] = min(mi[x<<1], mi[x<<1|1]);
}
int query(int x, int l, int r, int ql, int qr) {
if (ql <= l && qr >= r) {
return mi[x];
}
int mid = (l + r) >> 1;
if (qr <= mid) {
return query(x<<1,l,mid,ql,qr);
}
else if(ql > mid) {
return query(x<<1|1,mid+1,r,ql,qr);
}
else {
return min(query(x<<1,l,mid,ql,qr), query(x<<1|1,mid+1,r,ql,qr));
}
}
void solve() {
int n, m;
cin >> n >> m;
build(1,1,n);
while (m--) {
int l, r;
cin >> l >> r;
cout << query(1,1,n,l,r) << '\n';
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
t = 1;
while (t--) {
solve();
}
}