Pagini recente » Cod sursa (job #681226) | Cod sursa (job #2162063) | Cod sursa (job #826963) | Cod sursa (job #2921697) | Cod sursa (job #2091047)
#include <fstream>
#include <cmath>
using namespace std;
int ma[22][100002];
int main()
{
int n,m,i,j,t,tt,k,a,b,t1;
ifstream in("rmq.in");
ofstream out("rmq.out");
in>>n>>m;
for(i=1;i<=n;i++)
{
in>>ma[0][i];
}
k=1;
for(i=1;i<=log2(n);i++)
{
for(j=1;j<=n;j++)
{
ma[i][j]=min(ma[i-1][j],ma[i-1][j+k]);
}
k*=2;
}
for(i=1;i<=m;i++)
{
in>>a>>b;
t=b-a;
tt=log2(t);
t1=pow(2,tt);
out<<min(ma[tt][a],ma[tt][b-t1+1])<<endl;
}
return 0;
}