Pagini recente » Cod sursa (job #2078526) | Cod sursa (job #3214825) | Cod sursa (job #3140697) | Cod sursa (job #807563) | Cod sursa (job #2242619)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define nmax 100001
int N, M, rmq[nmax][18], log2[nmax];
int main()
{
int i, j, x, y;
fin>>N>>M;
for(i=1; i<=N; i++)
fin>>rmq[i][0];
for(i=2; i<=N; i++)
log2[i]=1+log2[i/2];
for(j=1; (1<<j)<=N; j++)
for(i=1; i+(1<<j)-1<=N; i++)
rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
while(M)
{
M--;
fin>>x>>y;
j=log2[y-x+1];
fout<<min(rmq[x][j], rmq[y-(1<<j)+1][j])<<'\n';
}
fin.close();
fout.close();
return 0;
}