Pagini recente » Cod sursa (job #2015115) | Cod sursa (job #2657921) | Solutii preONI 2007, Runda 4 | Cod sursa (job #288775) | Cod sursa (job #1374138)
#include<iostream>
#include<fstream>
#define NMAX 100001
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int d[20][NMAX],lg[NMAX];
int n,m;
int main()
{
fin>>n>>m;
lg[1]=0;
for(int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(int i=1;i<=n;i++)
fin>>d[0][i];
for(int i=1;i<=lg[n];i++)
for(int j=1;j<=n-(1<<(i-1));j++)
d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
int k,x,y;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
k=lg[y-x+1];
fout<<min(d[k][x],d[k][y-(1<<k)+1])<<'\n';
}
fout.close();
return 0;
}