Pagini recente » Cod sursa (job #910166) | Cod sursa (job #2566474) | Cod sursa (job #2110164) | Cod sursa (job #151528) | Cod sursa (job #3226046)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int v[100001],a[20][100001];
int main()
{
int n,m;
f>>n>>m;
v[1]=0;
for(int i=2;i<=100000;i++)
v[i]=v[i/2]+1;
for(int i=1;i<=n;i++)
f>>a[0][i];
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
a[j][i]=min(a[j-1][i],a[j-1][i+(1<<(j-1))]);
for(int w=1;w<=m;w++)
{
int x,y;
f>>x>>y;
int l=v[y-x+1];
g<<min(a[l][x],a[l][y-(1<<l)+1])<<'\n';
}
return 0;
}