Pagini recente » Cod sursa (job #3148034) | Cod sursa (job #49009) | Cod sursa (job #2542760) | Cod sursa (job #628405) | Cod sursa (job #2672638)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int INF = 0x3f3f3f3f3f3f3f3f;
int n,m;
int log2[100100], rmq[100100][20];
void logaritm()
{
for(int i=2;i<=n;i++)
log2[i]=log2[i/2]+1;
}
void precalcul()
{
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)<=n+1;i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
}
int interval(int x, int y)
{
int p=y-x+1;
return min(rmq[x][log2[p]],rmq[y-(1<<log2[p])+1][log2[p]]);
}
int main()
{
fin>>n>>m;
memset(rmq, INF, sizeof rmq);
for(int i=1;i<=n;i++)
fin>>rmq[i][0];
logaritm();
precalcul();
while(m--)
{
int x,y;
fin>>x>>y;
fout<<interval(x,y)<<'\n';
}
return 0;
}