Pagini recente » Cod sursa (job #921614) | Cod sursa (job #1060930) | Cod sursa (job #567895) | Cod sursa (job #2204338) | Cod sursa (job #1830639)
#include <cstdio>
#define NMax 100000
#define Log 17
#define MIN(a,b)((a)<(b)?(a):(b))
int rmq[Log+1][NMax+1];
int P[NMax+1];
int v[NMax+1];
int N;
void Compute()
{
int i,j;
for(i = 2; i <= NMax; ++i) P[i] = P[i/2] + 1;
for(i = 1; i <= N; ++i) rmq[0][i] = v[i];
for(i = 1; (1<<i) <= N; ++i)
for(j = 1; j <= N-(1<<i)+1; ++j)
rmq[i][j] = MIN( rmq[i-1][j], rmq[i-1][j+(1<<i-1)] );
}
int main(){
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
int i,j,M,x,y;
scanf("%d %d",&N,&M);
for(i = 1; i <= N; ++i) scanf("%d",&v[i]);
Compute();
for(i = 1; i <= M; ++i)
{
scanf("%d %d",&x,&y);
j = P[y-x+1];
printf("%d\n", MIN( rmq[j][x], rmq[j][y+1-(1<<j)] ) );
}
return 0;
}