Pagini recente » Cod sursa (job #914319) | Cod sursa (job #2093022) | Cod sursa (job #2863465) | Cod sursa (job #538675) | Cod sursa (job #2151998)
#include <fstream>
#define nmax 100002
#define lgmax 25
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int r[lgmax][nmax],lg[nmax];
int main()
{
int n,m,x,y;
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>r[0][i];
for(int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n-(1<<i-1);j++)
r[i][j]=min(r[i-1][j],r[i-1][j+(1<<i-1)]);
for(int i=1;i<=m;i++)
fin>>x>>y,fout<<min(r[lg[y-x+1]][y+1-(1<<lg[y-x+1])],r[lg[y-x+1]][x])<<"\n";
return 0;
}