Pagini recente » Cod sursa (job #2151258) | Cod sursa (job #2299673) | Cod sursa (job #1401063) | Cod sursa (job #1432777) | Cod sursa (job #2147529)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
#define nmax 100003
int rmq[20][nmax];
int lg[nmax],x,y,secv,n,m;
int main()
{
f>>n>>m;
for(int i=1; i<=n; i++)
{
f>>rmq[0][i];
if(i>1) lg[i]=lg[i/2]+1;
}
for(int i=1; (1<<i)<=n; i++)
for(int j=1; j<=n-(1<<(i-1)); j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for(int i=1; i<=m; i++)
{
f>>x>>y;
secv=y-x+1;
g<<min(rmq[lg[secv]][x],rmq[lg[secv]][y-(1<<lg[secv])+1])<<'\n';
}
return 0;
}