Pagini recente » Cod sursa (job #2394673) | Cod sursa (job #555733) | Cod sursa (job #2102616) | Cod sursa (job #2124359) | Cod sursa (job #2189775)
#include <bits/stdc++.h>
#define N 100002
#define LOGN 18
using namespace std;
int n, m;
int rmq[LOGN][N], l[LOGN];
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
for(int i=1; i<=n; i++) fin>>rmq[0][i];
l[1]=0;
for(int i=2; i<=n; i++) l[i]=l[i/2]+1;
for(int i=1; (1<<i) <= n; i++)
{
for(int j=1; j+(1<<i)-1 <= n; j++)
{
int limita=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+limita]);
}
}
int x,y,k,dif;
for(int i=1; i<=m; i++)
{
fin>>x>>y;
dif=y-x+1;
k=l[dif];
fout<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
}
return 0;
}