Pagini recente » Cod sursa (job #2308747) | Cod sursa (job #2283606) | Cod sursa (job #2637095) | Cod sursa (job #78730) | Cod sursa (job #2550857)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX=100010;
int n,q;
int v[NMAX];
int m[NMAX][20];
void citire()
{
fin>>n>>q;
for (int i=1; i<=n; i++)
fin>>v[i];
}
void construireTabel()
{
for (int i=1; i<=n; i++)
m[i][0]=v[i];
for (int j=1; (1<<j)<=n; j++){
for (int i=1; i+(1<<j)-1<=n; i++){
m[i][j]=min(m[i][j-1],m[i+(1<<(j-1))][j-1]);
}
}
}
int rmq(int a, int b)
{
int k=(int)floor(log2(b-a+1));
return min(m[a][k],m[b-(1<<k)+1][k]);
}
void rezolvare()
{
int a,b;
for (int i=1; i<=q; i++){
fin>>a>>b;
fout<<rmq(a,b)<<'\n';
}
}
int main()
{
citire();
construireTabel();
rezolvare();
fin.close();
fout.close();
return 0;
}