Pagini recente » Cod sursa (job #610042) | Cod sursa (job #650612) | Cod sursa (job #570286) | Cod sursa (job #2346118) | Cod sursa (job #3242639)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int nmax = 100000;
int n,m;
int r[20][nmax + 5];
int e[nmax + 5];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++) fin>>r[0][i];
for(int i=2;i<=n;i++) e[i] =e[i/2]+1;
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n;j++)
r[i][j] = min(r[i-1][j],r[i-1][j+(1<<(i-1))]);
for(int i=1;i<=m;i++)
{
int st,dr;
fin>>st>>dr;
int exp = e[dr-st+1];
fout<<min(r[exp][st],r[exp][dr-(1<<exp)+1])<<'\n';
}
}