Pagini recente » Cod sursa (job #2812737) | Cod sursa (job #1849631) | Cod sursa (job #1362305) | Cod sursa (job #2266939) | Cod sursa (job #3174302)
#include <iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("rmq.in", "r", stdin);
freopen("rmq.out", "w", stdout);
int n, m;
cin>>n>>m;
int v[n+1];
int st[25][n+1];
for(int i=1; i<=n; i++)
{
cin>>v[i];
st[0][i]=v[i];///pun pe prima linie
}
for(int i=1; i<=25; i++)
for(int j=1; j+(1<<i)-1 <= n; j++)
st[i][j]=min(st[i-1][j], st[i-1][j+(1<<(i-1))]);
int lg[n+1];
lg[1]=0;
for(int i=2; i<=n; i++)
lg[i]=lg[i/2]+1;
for(int ii=1; ii<=m; ii++)
{
int L, R;
cin>>L>>R;
int i=lg[R-L+1];
cout<<min(st[i][L], st[i][R-(1<<i)+1])<<'\n';
}
return 0;
}