Pagini recente » Cod sursa (job #1356657) | Cod sursa (job #73917) | Cod sursa (job #3154774) | Cod sursa (job #1369681) | Cod sursa (job #2622725)
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m;
int mx[20][100007];
int main()
{
in>>n>>m;
int m1 = log2(n)+1,aux;
for(int i=0;i<n;i++){
in>>aux;
mx[0][i] = aux;
}
mx[0][n] = 100007;
for(int i=1;i<m1;i++){
for(int j=0;j<n;j++)
mx[i][j] = min(mx[i-1][j],mx[i-1][j+1]);
mx[i][n] = 100007;
}
for(int i=0;i<m;i++){
int a,b;
in>>a>>b;
aux = log2(b-a);
out<<min(mx[aux][a-1],mx[aux][b-(1<<aux)])<<'\n';
}
return 0;
}