Pagini recente » Cod sursa (job #2652863) | Cod sursa (job #598989) | Cod sursa (job #2163888) | Cod sursa (job #3038246)
#include <fstream>
#define INF 1000000000
using namespace std;
ifstream fin ("rmq.in");
ofstream fout("rmq.out");
int a[17][100010];
int x[100010];
int n, m, i, j, st, dr, minim, p, e, l;
int main ()
{
fin>>n>>m;
for (i=1; i<=n; i++)
fin>>a[0][i];
for (p=1;(1<<p)<=n; p++)
for (i=1;i<=n;i++)
{
a[p][i]=a[p-1][i];
j=i+(1<<(p-1));
if (j<=n&&a[p][i]>a[p-1][j])
a[p][i]=a[p-1][j];
}
x[1]=0;
for (i=2; i<=n; i++)
x[i]=1+x[i/2];
for (i=1;i<=m;i++)
{
fin>>st>>dr;
e=x[dr-st+1];
l=(1<<e);
fout<<min(a[e][st],a[e][dr-l+1])<<"\n";
}
return 0;
}