Pagini recente » Cod sursa (job #2538189) | Cod sursa (job #927259) | Cod sursa (job #433324) | Cod sursa (job #2778646) | Cod sursa (job #1686778)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
#define LG 18
#define NMAX 100002
int N,M;
int rmq[LG][NMAX];
int a[NMAX];
int lg[NMAX];
int i,j,l;
int main()
{
f>>N>>M;
for(i=1;i<=N;++i)
f>>a[i];
lg[1]=0;
for(i=2;i<=N;++i)
lg[i]=lg[i/2]+1;
for(i=1;i<=N;++i)
rmq[0][i]=a[i];
for(i=1;(1<<i)<=N;++i)
for(j=1;j<=N-(1<<i)+1;++j)
{
l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);}
long int x,y,chestie,dif;
for(i=1;i<=M;i++)
{
f>>x>>y;
dif=y-x+1;
l=lg[dif];
chestie=dif-(1<<l);
g<<min(rmq[l][x],rmq[l][x+chestie])<<'\n';
}
return 0;
}