Pagini recente » Cod sursa (job #1509233) | Cod sursa (job #1990542) | Cod sursa (job #2053573) | Cod sursa (job #2433978) | Cod sursa (job #3160367)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[19][100001], exp[100001];
int main()
{
int n, m, i, p, e, j, st, dr, rez;
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>rmq[0][i];
}
for(p=1;(1<<p)<=n;p++)
{
for(i=1;i<=n;i++)
{
rmq[p][i]=rmq[p-1][i];
j=i+(1<<(p-1));
if(j<=n&&rmq[p-1][j]<rmq[p][i])
{
rmq[p][i]=rmq[p-1][j];
}
}
}
exp[1]=0;
for(i=2;i<=n;i++)
{
exp[i]=1+exp[i/2];
}
for(i=1;i<=m;i++)
{
fin>>st>>dr;
e=exp[dr-st+1];
j=1<<e;
fout<<min(rmq[e][st], rmq[e][dr-j+1])<<"\n";
}
}