Pagini recente » Cod sursa (job #2270840) | Cod sursa (job #407656) | Cod sursa (job #302525) | Istoria paginii runda/summer2020 | Cod sursa (job #2664694)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int rmq[20][100005],n,m;
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
f>>rmq[0][i];
for(int i=1;i<=(int)log2(n);i++)
for(int j=1;j<=n-(1<<(i-1));j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
while(m--)
{
int x,y;
f>>x>>y;
int k=log2(y-x+1);
g<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
}
return 0;
}