Pagini recente » Cod sursa (job #210579) | Cod sursa (job #2861050) | Cod sursa (job #1742706) | Cod sursa (job #3326539) | Cod sursa (job #3326740)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,a,b;
int A[100001];
int M[20][100001];
int main()
{
fin>>n>>m;
for(int i=0; i<n; i++)
{
fin>>A[i];
M[0][i]=A[i];
}
for(int i=1; i<=log2(n); i++)
{
for(int j=0; j+(1<<i)<=n; j++)
{
M[i][j]=min(M[i-1][j],M[i-1][j+(1<<(i-1))]);
//fout<<M[i][j]<<" ";
}
//fout<<endl;
}
for(int i=1;i<=m;i++)
{
fin>>a>>b;
a--;
b--;
int logg=log2(b-a+1);
fout<<min(M[logg][a],M[logg][b-(1<<logg)+1])<<'\n';
}
return 0;
}