Pagini recente » Cod sursa (job #2687996) | Cod sursa (job #860335) | Cod sursa (job #2708201) | Cod sursa (job #2251386) | Cod sursa (job #2397497)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,q,a[100002],lg[100002],rmq[100002][20];
int main()
{
f>>n>>q;
f>>a[1];
rmq[1][0]=a[1];
for(int i=2;i<=n;++i)
{
f>>a[i];
lg[i]=lg[i/2]+1;
rmq[i][0]=a[i];
}
for(int i=1; ( 1<<i ) <=n;i++)
{
for(int j=1; j <= n-(1<<i)+1 ;j++)
{
rmq[j][i] = min(rmq[j][i-1],rmq[j+(1<<(i-1))][i-1]);
}
}
for(int i=1;i<=q;++i)
{
int a,b,x;
f>>a>>b;
x = lg[b-a+1];
g<<min(rmq[a][x],rmq[b-(1<<x)+1][x])<<'\n';
}
return 0;
}