Pagini recente » Cod sursa (job #2928175) | Cod sursa (job #20589) | Cod sursa (job #943961) | Cod sursa (job #2332668) | Cod sursa (job #3201006)
#include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,k,r[20][100020],e[100020];
int main()
{
f>>n>>m;
for(int i=1; i<=n; i++)
f>>r[0][i];
for(int p=1; (1<<p)<=n; p++)
{
for(int i=1; i<=n; i++)
{
r[p][i]=r[p-1][i];
int j=i+(1<<(p-1));
if(j<=n and r[p][i]>r[p-1][j])
r[p][i]=r[p-1][j];
}
}
e[1]=0;
for(int i=2; i<=n; i++)
e[i]=e[i/2]+1;
for(int i=1; i<=m; i++)
{
int x,y;
f>>x>>y;
int l=e[y-x+1];
g<<min(r[l][x],r[l][y-(1<<l)+1])<<'\n';
}
return 0;
}