Pagini recente » Cod sursa (job #652250) | Cod sursa (job #3337192) | Cod sursa (job #1341998) | Cod sursa (job #3346933) | Cod sursa (job #2854840)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[100005][17],log[100005];
int main()
{
int n,m;
fin.tie(0);
fin>>n>>m;
log[1]=0;
for(int i=2;i<=n;i++)
{
log[i]=log[i>>1]+1;
}
for(int i=1;i<=n;i++)
{
fin>>v[i][0];
}
for(int i=1;(1<<i)<=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=log[mx-mn+1];
fout<<min(v[mn][k],v[mx-(1<<k)+1][k])<<endl;
}
fout.flush();
return 0;
}