Pagini recente » Monitorul de evaluare | Atasamentele paginii Mult | Diferente pentru problema/dir intre reviziile 19 si 18 | Monitorul de evaluare | Cod sursa (job #897965)
Cod sursa(job #897965)
#include <iostream>
#include <fstream>
#define NMAX 100010
#define LMAX 18
using namespace std;
int M[LMAX][NMAX];
int n,m;
int L[NMAX];
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>M[0][i];
L[1]=0;
for(int i=2;i<=n;i++)
L[i]=L[i/2]+1;
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n-(1<<i)+1;j++)
{
int l=(1<<(i-1));
M[i][j]=min(M[i-1][j],M[i-1][j+l]);
}
int x,y;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
int dif=y-x+1;
int l=L[dif];
int sh=dif-(1<<l);
fout<<min(M[l][x],M[l][x+sh])<<"\n";
}
return 0;
}