Pagini recente » Cod sursa (job #965386) | Cod sursa (job #3275461) | Cod sursa (job #2487139) | Cod sursa (job #1891671) | Cod sursa (job #2977208)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,lg[100005],rmq[1005][100005],j,a[100005];
int query(int x,int y)
{
int k=lg[y-x];
return min(rmq[k][x],rmq[k][y-(1<<k)+1]);
}
int main()
{
int x,y;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
rmq[0][i]=a[i];
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i=1;i<=lg[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))]);
for(i=1;i<=m;i++)
{
fin>>x>>y;
fout<<query(x,y)<<'\n';
}
return 0;
}