题目链接:
题意:
题解:
区间查询最小值
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 1e5+10;
int a[maxn],ans[maxn];
struct node{
int l,r,minn;
}tree[maxn<<2];
void pushup(int rt){
tree[rt].minn = min(tree[rt<<1].minn,tree[rt<<1|1].minn);
}
void build(int rt,int l,int r){
tree[rt].l = l, tree[rt].r = r;
// tree[rt].minn = INF;
if(l == r)
tree[rt].minn = a[l];
else{
int mid = (l+r)/2;
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
pushup(rt);
}
}
int query(int rt,int l,int r){
int L = tree[rt].l, R = tree[rt].r;
if(l<=L && R<=r)
return tree[rt].minn;
int ans = INF;
int mid = (L+R)/2;
if(l <= mid) ans = min(ans,query(rt<<1,l,r));
if(r>mid) ans = min(ans,query(rt<<1|1,l,r));
return ans;
}
int main(){
int n=read(), q=read();
for(int i=1; i<=n; i++)
a[i] = read();
build(1,1,n);
int cnt = 0;
for(int i=0; i<q; i++){
int a=read(),b=read();
int tmp = query(1,a,b);
ans[++cnt] = tmp;
}
for(int i=1; i<cnt; i++)
cout << ans[i] << " ";
cout << ans[cnt] << endl;
return 0;
}