Pagini recente » Cod sursa (job #1382960) | Cod sursa (job #40533) | Cod sursa (job #3186144) | Cod sursa (job #392733) | Cod sursa (job #2099807)
#include <fstream>
#include <cmath>
using namespace std;
int ma[22][100002];
int main()
{
int n,m,i,j,k,t,t1,q,a,b;
ifstream in("rmq.in");
ofstream out("rmq.out");
in>>n>>q;
for(i=1;i<=n;i++)
{
in>>ma[0][i];
}
k=1;
m=log2(n);
for(i=1;i<=m;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<=q;i++)
{
in>>a>>b;
t=log2(b-a+1);
t1=1<<t;
out<<min(ma[t][a],ma[t][b-t1+1])<<"\n";
}
return 0;
}