Pagini recente » Cod sursa (job #421597) | Cod sursa (job #2710686) | Cod sursa (job #485168) | Cod sursa (job #335608) | Cod sursa (job #2371139)
#include <bits/stdc++.h>
#define MAXN (1<<19)
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,lg2[MAXN],m,i,j,v[MAXN],a[20][MAXN],x,y,d;
int main()
{ f>>n>>m;
for( i=1;i<=n;i++)
{ f>>v[i];
a[0][i]=v[i];
}
for(i=2;i<=n;i++)
lg2[i]=lg2[i/2]+1;
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=min(a[i-1][j],a[i-1][j-(1<<(i-1))]);
for(i=1;i<=m;i++)
{ f>>x>>y;
d=lg2[y-x+1];
g<<min(a[d][y],a[d][x+(1<<d)-1])<<'\n';
}
return 0;
}