Pagini recente » Cod sursa (job #2039863) | Cod sursa (job #2617081) | Cod sursa (job #2586640) | Cod sursa (job #2271252) | Cod sursa (job #1497787)
#include <cstdio>
using namespace std;
const int N=100005;
const int M=18;
int rmq[M][N];
int v[N],lg[N];
int min1(int x,int y)
{
if(x==0)
x=9999999;
if(y==0)
y=9999999;
if(x<y)
return x;
else
return y;
}
int main()
{
FILE *in,*out;
in=fopen("rmq.in","r");
out=fopen("rmq.out","w");
int n,m,i,pow,j,k,x,y,l,dif,ras;
fscanf(in,"%d %d",&n,&m);
for(i=1;i<=n;i++)
{
fscanf(in,"%d",&rmq[0][i]);
lg[i]=lg[i/2]+1;
}
for(i=1;(1<<i)<=n;i++)
{
pow=1<<i;
for(j=pow;j<=n;j++)
{
rmq[i][j]=min1(rmq[i-1][j],rmq[i-1][j-pow/2]);
}
}
for(k=1;k<=m;k++)
{
fscanf(in,"%d%d",&x,&y);
dif=y-x;
l=lg[dif];
ras=min1(rmq[l-1][y],rmq[l-1][x+l-1]);
fprintf(out,"%d\n",ras);
}
return 0;
}