Pagini recente » Cod sursa (job #2600081) | Cod sursa (job #1827172) | Cod sursa (job #314611) | Cod sursa (job #1827198) | Cod sursa (job #3196210)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,m,i,j,tab[100009][30];
int main()
{
cin>>n>>m;
for(i=1; i<=n; i++)
cin>> tab[i][0];
int p;
p=(int)log2(n);
for(j=1; j<=p; j++)
for(i=1; i<=n; i++)
{
int x=i+(1<<(j-1));
if(x>n)
x=n+1;
tab[i][j]=min(tab[i][j-1],tab[x][j-1]);
}
/*cout<<endl;
for(i=0; i<=n; i++)
{
for(j=0; j<=p; j++)
cout<<tab[i][j]<<' ';
cout<<endl;
}*/
for(i=1; i<=m; i++)
{
int st,dr;
cin>>st>>dr;
int e;
e=(int)log2(dr-st+1);
cout<<min(tab[st][e],tab[dr-(1<<e)+1][e])<<endl;
}
return 0;
}