Pagini recente » Cod sursa (job #752876) | Cod sursa (job #1888158) | Cod sursa (job #1617477) | Cod sursa (job #122570) | Cod sursa (job #2870846)
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int n, m, st, dr;
int r[19][100002];
int E[100002];
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>r[0][i];
for(int p=1; (1<<p)<=n; p++)
{
for(int i=1; i<=n-(1<<p)+1; i++)
{
int j=i+(1<<(p-1));
r[p][i]=min(r[p-1][i], r[p-1][j]);
}
}
E[1]=0;
for(int i=2; i<=n; i++)
E[i]=1+E[i/2];
for(int i=1; i<=m; i++)
{
fin>>st>>dr;
int L=dr-st+1;
int e=E[L];
fout<<min(r[e][st], r[e][dr-(1<<e)+1])<<"\n";
}
return 0;
}