Pagini recente » Cod sursa (job #1703140) | Cod sursa (job #2356092) | Cod sursa (job #2673647) | Cod sursa (job #28267) | Cod sursa (job #3287105)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int rmq[20][100005],lg;
int main()
{
int n,m,a,b;
in>>n>>m;
for(int i=0;i<n;i++)
in>>rmq[0][i];
lg=log2(n);
for(int j=1;j<=lg;j++)
for(int i=0;i<=n-(1<<j);i++)
rmq[j][i]=min(rmq[j-1][i],rmq[j-1][i+(1<<(j-1))]);
for(int i=1;i<=m;i++)
{
in>>a>>b;
a--;
b--;
if(a==b)
lg=0;
else
lg=log2(b-a);
out<<min(rmq[lg][a],rmq[lg][b-(1<<lg)+1])<<"\n";
}
return 0;
}