Pagini recente » Cod sursa (job #737972) | Cod sursa (job #3320669) | Cod sursa (job #2900983) | Cod sursa (job #3310906) | Cod sursa (job #2854810)
#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>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>v[i][0];
}
log[1]=0;
for(int i=2;i<=n;i++)
{
log[i]=log[i/2]+1;
}
for(int i=1;i<=log[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][log[k]],v[mx-(1<<log[k])+1][log[k]])<<endl;
}
return 0;
}