Pagini recente » Cod sursa (job #48809) | Cod sursa (job #1332246) | Cod sursa (job #84538) | Cod sursa (job #1302124) | Cod sursa (job #2683762)
#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m;
vector<int> d[100001];
int x,y,p;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>x;
d[i].push_back(x);
}
for(int j=1;j<=n;j++)
{
for(int i=1;i<=n;i++)
{
if(i+(1<<j)-1<=n)
{
d[i].push_back(min(d[i][j-1],d[i+(1<<(j-1))][j-1]));
}
}
}
/*for(int i=1;i<=n;i++)
{
for(int j=0;i+(1<<j)<=n;j++)
{
cout<<d[i][j]<<" ";
}
cout<<endl;
}*/
for(int i=1;i<=m;i++)
{
fin>>x>>y;
p = log2(y-x+1);
fout<<min(d[x][p],d[y-(1<<p)+1][p])<<'\n';
}
}