Pagini recente » Cod sursa (job #408212) | Cod sursa (job #537045) | Cod sursa (job #1726753) | Cod sursa (job #2299535) | Cod sursa (job #2284636)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int v[100001];
int rmq[20][100001];
int main()
{
int n,m;
f>>n;
f>>m;
for(int i=1;i<=n;i++)
f>>rmq[0][i];
for(int i=1;i<=log2(n);++i)
for(int j=1;j + (1 << i) -1 <=n;j++)
rmq[i][j]=min(rmq[i-1][j] ,rmq[i-1][j+ (1<< (i-1))]);
/*for(int i=0;i<=log2(n);i++)
{for(int j=1;j<=n;j++)
g<<rmq[i][j]<<" ";
g<<'\n';
}*/
int x,y;
int logarg=log2(y-x);
for(int i=1;i<=m;i++)
{
f>>x>>y;
g<<min(rmq[logarg][x],rmq[logarg][y- (1 << logarg ) +1])<<'\n';
}
return 0;
}