Pagini recente » Cod sursa (job #2151326) | Cod sursa (job #1052879) | Cod sursa (job #529967) | Cod sursa (job #654737) | Cod sursa (job #2572747)
#include <fstream>
using namespace std;
ifstream fi("rmq.in");
ofstream fo("rmq.out");
const int nmax=1e5;
int n, m;
int X[nmax+5], log2[nmax+5];
int rmq[nmax+5][20];
int main()
{
fi>>n>>m;
for(int i=1; i<=n; i++)
{
int x;
fi>>x;
rmq[i][0]=x;
}
log2[1]=0;
for(int i=2; i<=n; i++)
log2[i]=log2[i/2]+1;
for(int j=1; j<=log2[n]; j++)
for(int i=1; i<=n-(1<<j)+1; i++)
rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
while(m--)
{
int x, y;
fi>>x>>y;
int range=log2[y-x+1];
fo<<min(rmq[x][range], rmq[y-(1<<range)+1][range])<<"\n";
}
fi.close();
fo.close();
return 0;
}