Pagini recente » Cod sursa (job #328074) | Cod sursa (job #273701) | Cod sursa (job #3357005) | Borderou de evaluare (job #1666799) | Cod sursa (job #2854751)
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[100005][17];
int main()
{
int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>v[i][0];
}
for(int i=1;i<=int(log2(n));i++)
{
for(int j=1;j<=n-(1<<i)+1;j++)
{
v[j][i]=min(v[j][i-1],v[j+(1<<i-1)][i-1]);
}
}
for(int i=1;i<=m;i++)
{
int mn,mx,k;
fin>>mn>>mx;
k=mx-mn+1;
fout<<min(v[mn][int(log2(k))],v[mx-(1<<int(log2(k)))+1][int(log2(k))])<<endl;
}
return 0;
}