Pagini recente » Cod sursa (job #2826828) | Cod sursa (job #2898207) | Cod sursa (job #2272663) | Cod sursa (job #1364293) | Cod sursa (job #3122859)
#include <fstream>
#include <tgmath.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, i, j, a[100010], rmq[20][100010], x, y, lg;
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
{
fin>>a[i];
rmq[0][i]=a[i];
}
for(i=1; i<=int(log2(n)); i++)
{
for(j=1; j<=n-(1<<i)+1; j++)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
//fout<<'\n';
}
for(i=1; i<=m; i++)
{
fin>>x>>y;
lg=y-x+1;
fout<<min(rmq[int(log2(lg))][x], rmq[int(log2(lg))][y-(1<<int(log2(lg)))+1])<<'\n';
}
return 0;
}