Pagini recente » Cod sursa (job #3163332) | Cod sursa (job #2300284) | Cod sursa (job #1117987) | Cod sursa (job #1860088) | Cod sursa (job #2433801)
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, q, rmq[20][100005], lg[100006], x, y;
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
cin>>n>>q;
for(i=1;i<=n;i++)
cin>>rmq[0][i];
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i=1;i<=lg[n];i++)
for(j=1;j<=n;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
/** for(i=1;i<=lg[n];i++,cout<<'\n')
for(j=1;j<=n;j++)
cout<<rmq[i][j]<<' ';**/
while(q)
{
q--;
cin>>x>>y;
int lgg=lg[y-x];
cout<<min(rmq[lgg][x],rmq[lgg][y-(1<<lgg)+1])<<'\n';
}
///1,2 2,3 3,4 4,5
///1,4 2,5
return 0;
}