Pagini recente » Cod sursa (job #2624987) | Cod sursa (job #2744436) | Cod sursa (job #2680595) | Cod sursa (job #3153647) | Cod sursa (job #2453013)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m,rmq[20][1000005],lg[1000005],x,y;
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
{
in>>rmq[0][i];
}
for(int i=2;i<=n;i++)
{
lg[i]=lg[i/2]+1;
}
for(int i=1;i<=lg[n];i++)
{
for(int j=1;j+(1<<i)-1<=n;j++)
{
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
}
for(int j=1;j<=m;j++)
{
in>>x>>y;
int t=lg[y-x+1];
out<<min(rmq[t][x],rmq[t][y-(1<<t)+1])<<'\n';
}
return 0;
}