Pagini recente » Cod sursa (job #1890260) | Cod sursa (job #2751211) | Cod sursa (job #2961424) | Cod sursa (job #1546735) | Cod sursa (job #2027738)
#include <fstream>
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
int n,t,lg[25],v[25][100003],x,y,dif;
int main()
{
f>>n>>t;
for(int i=1;i<=n;++i) f>>v[0][i];
for(int i=2;i<=n;++i) lg[i]=lg[i/2]+1;
for(int i=1;(1<<i)<=n;++i)
{
for(int j=1;j+(1<<i)<=n+1;++j) v[i][j]=min(v[i-1][j],v[i-1][j+(1<<(i-1))]);
}
while(t--)
{
f>>x>>y;
dif=y-x+1;
dif=lg[dif];
g<<min(v[dif][x],v[dif][y-(1<<dif)+1])<<'\n';
}
return 0;
}