Pagini recente » Cod sursa (job #3120494) | Cod sursa (job #2397737) | Cod sursa (job #2494367) | Cod sursa (job #2318690) | Cod sursa (job #2647732)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
long long rmq[20][100005];
long long logg[100005];
int main()
{
int n,m;
in>>n>>m;
for(int i=1;i<=n;i++)
in>>rmq[0][i];
logg[1]=0;
for(int i=2;i<=n;i++)
logg[i]=logg[i/2]+1;
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<<j-1)]);
}
}
for(int i=1;i<=m;i++)
{
int x,y;
in>>x>>y;
int a=logg[y-x+1];
out<<min(rmq[a][x],rmq[a][x+(y-x+1)-(1<<a)])<<"\n";
}
return 0;
}