Pagini recente » Cod sursa (job #1135065) | Cod sursa (job #1391453) | Cod sursa (job #1554353) | Cod sursa (job #1217861) | Cod sursa (job #2623773)
#include<fstream>
#define N 1<<17
#define M 1<<5
int n,m,x,y,l;
int v[N],lg[N],rmq[M][N];
inline int min(int a,int b)
{
if (a<b)
return a;
return b;
}
int main()
{
std::ifstream f("rmq.in");
std::ofstream g("rmq.out");
f>>n>>m;
int i,j,t,k;
for (i=1; i<=n; i++)
{
f>>v[i];
lg[i]=i>=2 ? lg[i/2]+1 : 0;
rmq[0][i]=v[i];
}
for (i=1; (1<<i)<=n; i++)
{
t=1<<i;
k=1<<(i-1);
for (j=1; j<=n-t+1; j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][(j+t-1)-k+1]);
}
for (i=1; i<=m; i++)
{
f>>x>>y;
l=lg[y-x+1];
t=1<<l;
g<<min(rmq[l][x],rmq[l][y-t+1]);
}
return 0;
}