Pagini recente » Cod sursa (job #1122329) | Cod sursa (job #2103810) | Cod sursa (job #2084759) | Cod sursa (job #2262475) | Cod sursa (job #1674081)
#include<fstream>
using namespace std;
#define NMAX 100005
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,x,y,d,P[NMAX]={-1},D[20][NMAX];
int main()
{
int i,j;
fin>>n>>m;
for (i=1;i<=n;++i)
{
fin>>D[0][i];
P[i]=1+P[i>>1];
}
for (i=1;i<=1+P[n];++i)
for (j=1;j<=n;++j)
{
D[i][j]=D[i-1][j];
if ((j+(1<<(i-1)))<=n)
D[i][j]=min(D[i][j],D[i-1][j+(1<<(i-1))]);
}
for (i=1;i<=m;++i)
{
fin>>x>>y;
d=P[y-x+1];
fout<<min(D[d][x],D[d][y-(1<<d)+1])<<"\n";
}
return 0;
}