Pagini recente » Cod sursa (job #733602) | Cod sursa (job #512395) | Cod sursa (job #530496) | Cod sursa (job #995501) | Cod sursa (job #2502027)
#include<iostream>
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
int rmq[20][10000];
ifstream fin("rmq.in");
ofstream fout("rmq.out");
//rmq[i][j] =
int main()
{
int n,m,k;
fin>>n>>m;
int lg[10000];
lg[0] = 1;
for(int i = 1;i<=n;i++)
{
lg[i] = log(i>>1)+1;
}
for(int i=1;i<=n;i++)
{
fin>>rmq[0][i];
}
for(int i=1; (1<<i) <= n;i++)
{
for(int j=1;j<=n-(1<<i)+1;j++)
{
rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
}
for(int i=1;i<=m;i++)
{
int a,b;
fin>>a>>b;
k = log(b-a);
fout<<min(rmq[k][a] , rmq[k][b-k])<<'\n';
}
}