Pagini recente » Cod sursa (job #2993) | Cod sursa (job #3294698) | Cod sursa (job #2238821) | Cod sursa (job #681253) | Cod sursa (job #402736)
Cod sursa(job #402736)
# include <fstream>
# include <iostream>
# include <cstdio>
using namespace std;
int n, m[100003][20];
void calcul ()
{
for (int j=1;(1<<j)<=n;j++)
for (int i=1;i+(1<<j)-1<=n;i++)
if (m[i][j-1]<=m[i+(1<<(j-1))][j-1])
m[i][j]=m[i][j-1];
else
m[i][j]=m[i+(1<<(j-1))][j-1];
}
int main ()
{
int lg[100003];
ifstream fin ("rmq.in");
freopen ("rmq.out", "w", stdout);
int w;
fin>>n>>w;
lg[1]=0;
for (int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for (int i=1;i<=n;i++)
fin>>m[i][0];
calcul ();
int i, j;
for (;w;--w)
{
int l, sh, diff;
fin>>i>>j;
diff=j-i+1;
l=lg[diff];
sh=diff-(1<<l);
if (m[i][l]<=m[i+sh][l])
printf("%d\n", m[i][l]);
else
printf("%d\n", m[i+sh][l]);
}
return 0;
}