Pagini recente » Cod sursa (job #2704916) | Cod sursa (job #56255) | Cod sursa (job #1962629) | Cod sursa (job #2167921) | Cod sursa (job #3160600)
include<fstream>
#define INF 1000000000;
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int r[17][100010];
int E[100010];
int n, p, i, j, st, dr, minim, p, e, len;
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>r[0][i];
for(p=1; (1<<p) <= n; p++)
{
for(i=1; i<=n; i++)
{
r[p][i]=r[p-1][i];
j=i+ (1<<(p-1));
if(j<=n && r[p][i]>r[p-1][j])
r[p][i]=r[p-1][j];
}
}
E[1]=0;
for(i=2; i<=n; i++)
E[i]=1+E[i/2];
for(i=1; i<=m; i++)
{
fin>st>>dr;
e=E[dr-st+1];
len= (1<<e);
fout<<min(r[e][st], r[e][dr-len+1])<<"\n";
}
}