Pagini recente » Cod sursa (job #1438029) | Cod sursa (job #1282180) | Cod sursa (job #2308839) | 24_februarie_simulare_oji_2024_clasele_11_12 | Cod sursa (job #2897773)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[100001][17],n,m,v[100001],x,y,l,log[100001];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++) fin>>v[i], a[i][0]=v[i];
for(int j=1;j<=16;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
a[i][j]=min(a[i][j-1], a[i+(1<<(j-1))][j-1]);
for(int i=2;i<=n;i++)
log[i]=log[i/2]+1;
for(int i=0;i<m;i++)
{
fin>>x>>y;
l=y-x+1;
fout<<min(a[x][log[l]], a[y-(1<<log[l])+1][log[l]])<<'\n';
}
}