Pagini recente » Cod sursa (job #1905920) | Cod sursa (job #679761) | Cod sursa (job #2707100) | Cod sursa (job #399109) | Cod sursa (job #2518139)
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f,*g;
int a[20][100002];
int log2[100002];
int n,m;
void read()
{
fscanf(f,"%d %d",&n,&m);
for(int i=1; i<=n; i++)
fscanf(f,"%d",&a[0][i]);
}
void Logarithm()
{
for(int i=2; i<=n; i++)
log2[i]=log2[i/2]+1;
}
int mini(int a, int b)
{
return a<b ? a:b;
}
void build_rmq()
{
for(int i=1; i<=log2[n]; i++)
for(int j=1; j<=n-(1<<(i-1)); j++)
a[i][j]=mini(a[i-1][j],a[i-1][j+(1<<(i-1))]);
}
void solve()
{
int x,y,k,sol;
Logarithm();
build_rmq();
for(int i=1; i<=m; i++)
{
fscanf(f,"%d %d",&x,&y);
k=log2[y-x+1];
sol=mini(a[k][x],a[k][y-(1<<k)+1]);
fprintf(g,"%d\n",sol);
}
}
int main()
{
f=fopen("rmq.in","r");
g=fopen("rmq.out","w");
read();
solve();
fclose(f);
fclose(g);
return 0;
}