Pagini recente » Cod sursa (job #2072486) | Cod sursa (job #2172399) | Cod sursa (job #135884) | Cod sursa (job #135407) | Cod sursa (job #2835598)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, v[17][100010], exp[100010], m, st, dr;
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
{
fin>>v[0][i];
}
for(int p=1; (1<<p)<=n; p++)
{
for(int i=1; i<=n; i++)
{
int j=i+(1<<(p-1));
v[p][i]=v[p-1][i];
if(j<=n && v[p][i]>v[p-1][j])
{
v[p][i]=v[p-1][j];
}
}
}
exp[1]=0;
for(int i=2; i<=n; i++)
{
exp[i]=exp[i/2]+1;
}
for(int i=1; i<=m; i++)
{
fin>>st>>dr;
int e=exp[dr-st+1];
int len=(1<<e);
fout<<min(v[e][st], v[e][dr-len+1])<<"\n";
}
return 0;
}