Pagini recente » Cod sursa (job #1234698) | Cod sursa (job #2439589) | Cod sursa (job #3282003) | Cod sursa (job #1237224) | Cod sursa (job #2285752)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int a[100001],rmq[18][100001],n,m,x,y,p;
int main()
{
int i,j;
f>>n>>m;
for(i=1; i<=n; i++)
{
f>>a[i];
rmq[0][i]=a[i];
}
for(i=1; (1 << i)<=n; i++)
{
for(j=1; j+(1 << (i-1))<=n; j++)
{
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1 << (i-1))]);
}
}
for(i=1; i<=m; i++)
{
f>>x>>y;
p=log2(y-x+1);
g<<min( rmq[p][x], rmq[p][y-( 1<<p) +1])<<'\n';
}
return 0;
}