Pagini recente » Cod sursa (job #654209) | Cod sursa (job #1667998) | Cod sursa (job #2604855) | Cod sursa (job #2513242) | Cod sursa (job #2876636)
#include <bits/stdc++.h>
using namespace std;
const int mx =100001;
const int mlg= 18;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m;
int v[mx], mat[mx][mlg], lg[mx];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>v[i];
mat[0][i]=v[i];
}
lg[1]=0;
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++)
{
int l=1<<(i-1);
mat[i][j]=min(mat[i-1][j], mat[i-1][j+l]);
}
}
int x,y;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
int dif=y-x+1;
int l=lg[dif],sh;
sh=dif-(1<<l);
fout<<min(mat[l][x],mat[l][x+sh])<<'\n';
}
return 0;
}