Pagini recente » Cod sursa (job #11753) | Cod sursa (job #332629) | Cod sursa (job #2253724) | Cod sursa (job #1041938) | Cod sursa (job #1953436)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define nmax 100005
int a[nmax], n, m, rmq[nmax][18], log2[nmax];
int main()
{
int i, j, x, y, sol;
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>a[i];
for(i=1; i<=n; i++)
rmq[i][0]=a[i];
for(i=2; i<=n; i++)
log2[i]=1+log2[i/2];
for(j=1; (1<<j)<=n; j++)
for(i=1; i+(1<<j)-1<=n; i++)
rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
while(m)
{
m--;
fin>>x>>y;
j=log2[y-x+1];
sol=min(rmq[x][j], rmq[y+1-(1<<j)][j]);
fout<<sol<<'\n';
}
return 0;
}