Pagini recente » Borderou de evaluare (job #1755438) | Borderou de evaluare (job #2816372) | Borderou de evaluare (job #1930907) | Borderou de evaluare (job #1990498) | Cod sursa (job #2501269)
#include <bits/stdc++.h>
using namespace std;
int rmq[25][100001],v[100001];
int main()
{
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int n,m,x,y,nr;
cin>>n>>m;
for (int i=1; i<=n; i++)
{
cin>>rmq[0][i];
}
for(int i=1; (1<<i)<=n; i++)
{
for(int j=1; j<=n; j++)
{
rmq[i][j]=rmq[i-1][j];
if(rmq[i-1][j+(1<<(i-1))]<rmq[i-1][j] && (j+(1<<(i-1)))<=n)
rmq[i][j]=rmq[i-1][j+(1<<(i-1))];
}
}
for(int i=2; i<=n; i++)
v[i]=v[i/2]+1;
for (int i=1; i<=m; i++)
{
cin>>x>>y;
nr=log2(y-x+1);
cout<<min(rmq[nr][x],rmq[nr][y-(1<<nr)+1])<<"\n";
}
return 0;
}