Pagini recente » Cod sursa (job #816285) | Cod sursa (job #302994) | Istoria paginii runda/23dezile_5 | Cod sursa (job #2260939) | Cod sursa (job #2173821)
#include <fstream>
#include <cmath>
using namespace std;
int rmq[22][100002];
int main()
{
int n,q,m,k,t,tt,a,b;
ifstream in("rmq.in");
ofstream out("rmq.out");
in>>n>>q;
for(int i=1;i<=n;i++)
{
in>>rmq[0][i];
}
k=1;
m=log2(n);
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+k]);
}
k=k*2;
}
for(int i=1;i<=q;i++)
{
in>>a>>b;
t=log2(b-a+1);
tt=pow(2,t);
out<<min(rmq[t][a],rmq[t][b-tt+1])<<"\n";
}
return 0;
}