Pagini recente » Cod sursa (job #1517106) | Cod sursa (job #1630258) | Cod sursa (job #57783) | Cod sursa (job #955849) | Cod sursa (job #2900314)
#include <bits/stdc++.h>
#pragma GCC optimize("O3,inline")
#define FILE "rmq"
using namespace std;
ifstream fin(FILE".in");
ofstream fout(FILE".out");
int rmq[462000];
int N,x,y,M;
void insert(int val, int pos, int posInRMQ, int st, int dr){
if(st == dr){
rmq[posInRMQ] = val;
return;
}
if(pos <= ((st+dr)>>1)){
insert(val, pos, posInRMQ*2, st, ((st+dr)>>1));
rmq[posInRMQ] = min(rmq[posInRMQ*2], rmq[posInRMQ*2 + 1]);
}
if(pos >= ((st+dr)>>1)){
insert(val, pos, posInRMQ*2 + 1, ((st+dr)>>1)+1, dr);
rmq[posInRMQ] = min(rmq[posInRMQ*2], rmq[posInRMQ*2 + 1]);
}
}
int getMinValue(int x, int y, int pos, int st = 1, int dr = N){
if(x <= st && y >= dr)
return rmq[pos];
else if(st <= y && dr >= x)
return min(getMinValue(x,y,2*pos,st,((st+dr)>>1)),getMinValue(x,y,2*pos+1,((st+dr)>>1)+1,dr));
return INT_MAX;
}
int main(){
fin >> N >> M;
ios::sync_with_stdio(false);
for(int i = 0; i < N; ++i){
fin >> x;
insert(x, i, 1, 0, N-1);
}
for(int i = 0; i < M; ++i){
fin >> x >> y;
fout << getMinValue(x,y,1) << '\n';
}
}