Pagini recente » Cod sursa (job #1442620) | Cod sursa (job #658031) | Cod sursa (job #991321) | Cod sursa (job #2378411) | Cod sursa (job #2514482)
#include <fstream>
#include <iostream>
#define NMAX 100000
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, log2[NMAX+10], a[NMAX+10][20];
void precalc()
{ log2[1] = 0;
for(int i=2; i<=NMAX; i++)
{ log2[i] = log2[i-1];
if((i & (i-1)) == 0) log2[i]++;
}
}
int main()
{
precalc();
f >> n >> m;
for(int i=1; i<=n; i++) f >> a[i][0];
for(int i=1; i<=(1<<n); i++)
for(int j=1; j<=n-(1<<i)+1; j++) a[j][i] = min(a[j][i-1], a[j+(1<<(i-1))][i-1]);
while(m--)
{ int x, y, l;
f >> x >> y;
l = log2[y-x+1];
g << min(a[x][l], a[y-(1<<l)+1][l]) << '\n';
}
return 0;
}