Pagini recente » Cod sursa (job #2418950) | Cod sursa (job #3208685) | Cod sursa (job #2289404) | Cod sursa (job #1618625) | Cod sursa (job #2904308)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmquery[18][100001];
int query(int x,int y)
{
int p=1,ct=0;
while (p*2<=y-x+1)
{
p=p*2;
ct++;
}
return min(rmquery[ct][x], rmquery[ct][y-p+1]);
}
int main()
{
int n,m,x,y;
fin>>n>>m;
for (int i=1; i<=n; i++)
fin>>rmquery[0][i];
for (int i=1,p=2; p<=n; i++,p*=2)
for (int j=1; j<=n; j++)
rmquery[i][j]=min(rmquery[i-1][j],rmquery[i-1][j+p/2]);
for (int i=1; i<=m; i++)
{
fin>>x>>y;
fout<<query(x,y)<<'\n';
}
return 0;
}