Pagini recente » Cod sursa (job #1993262) | Cod sursa (job #2191789) | Cod sursa (job #2853826) | Cod sursa (job #1701520) | Cod sursa (job #376658)
Cod sursa(job #376658)
#include<fstream>
#define inf "rmq.in"
#define outf "rmq.out"
#define NMax 100001
#define LMax 18
using namespace std;
fstream f(inf,ios::in),g(outf,ios::out);
int v[NMax];
int m[NMax][LMax];
int lg[NMax];
int N,M;
void Citire()
{
f>>N>>M;
for(int i=1;i<=N;i++)f>>v[i];
lg[1]=0;
for(int i=2;i<=N;i++)lg[i]=lg[i/2]+1;
}
void Rezolvare()
{
for(int i=1;i<=N;i++)m[i][0]=v[i];
for(int j=1; (1<<j) <= N; j++)
{
for(int i=1; i+ (1<<j)-1 <=N; i++)
{
if(m[i][j-1]<m[i+(1<<(j-1))][j-1])m[i][j]=m[i][j-1];
else m[i][j]=m[i+(1<<(j-1))][j-1];
}
}
}
void Raspunde()
{
int x,y,dif,l,sh;
for(int i=1;i<=M;i++)
{
f>>x>>y;
dif=y-x+1;
l=lg[dif];
sh=dif-(1<<l);
if(m[x][l]<m[x+sh][l])g<<m[x][l]<<"\n";
else g<<m[x+sh][l]<<"\n";
}
}
int main()
{
Citire();
Rezolvare();
Raspunde();
f.close();
g.close();
return 0;
}