Pagini recente » Cod sursa (job #922244) | Cod sursa (job #2184557) | Cod sursa (job #2803417) | Cod sursa (job #1071483) | Cod sursa (job #2683769)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int rm[26][100000],i,j,n,m,v[100000],p,x,y;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>rm[0][i];
for(i=1;i<=log2(n);i++)
for(j=1;j+(1<<i)-1<=n;j++)
rm[i][j]=min(rm[i-1][j],rm[i-1][j+(1<<(i-1))]);
for(i=1;i<=m;i++)
{
f>>x>>y;
p=log2(y-x+1);
g<<min(rm[p][x],rm[p][y-(1<<p)+1])<<endl;
}
return 0;
}