Cod sursa(job #2622742)
Utilizator | Data | 1 iunie 2020 19:00:42 | |
---|---|---|---|
Problema | Range minimum query | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m;
int mx[100005][20];
int main()
{
in>>n>>m;
int aux;
for(int i=0;i<n;i++)
in>>mx[i][0];
for(int i=1;i<20;i++)
for (int j=0;j<n-(1<<(i));j++)
mx[j][i] = min(mx[j][i-1],mx[j+(1<<(i-1))][i-1]);
for(int i=0;i<m;i++){
int a,b;
in>>a>>b;
aux = log2(b-a);
out<<min(mx[a-1][aux],mx[b-(1<<aux)][aux])<<'\n';
}
return 0;
}