Pagini recente » Cod sursa (job #2591588) | Cod sursa (job #3258600) | Cod sursa (job #1976126) | Cod sursa (job #1391978) | Cod sursa (job #2973337)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int lg2[100005];
int v[100005];
int rmq[20][100005];
int main()
{
int n,m;
int x,y;
in>>n>>m;
for(int i=1; i<=n; i++)
in>>v[i];
lg2[1]=0;
for(int i=2; i<=n; i++)
lg2[i]=lg2[i/2]+1;
for(int i=1; i<=n; i++)
rmq[0][i]=v[i];
for(int i=1; i<=lg2[n]; i++)
{
for(int j=1; j<=n; j++)
{
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j-(1<<(i-1))]);
}
}
int l;
for(int i=1; i<=m; i++)
{
in>>x>>y;
l=lg2[y-x+1];
out<<min(rmq[l][y],rmq[l][x+(1<<l)-1])<<'\n';
}
return 0;
}