Pagini recente » Cod sursa (job #1483443) | Istoria paginii utilizator/boutiquequorn | Cod sursa (job #2213694) | Cod sursa (job #2278896) | Cod sursa (job #1829381)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int log2[100005], m, n, i, j;
int sol[20][100005], x, y, z, delta, dif;
int main() {
f >> n >> m;
for (i = 1; i <= n; i++)
f >> sol[0][i];
for (i = 2; i <= n; i++)
log2[i] = log2[i/2] + 1;
for (i = 1; (1 << i) <= n; i++)
for (j = 1; j+(1<<i)-1 <= n; j++)
sol[i][j] = min(sol[i-1][j], sol[i-1][j + (1 << (i-1))]);
/*for (i = 0; (1 << i) <= n; i++) {
for (j = 1; j <= n; j++)
g << sol[i][j] << ' ' ;
g << '\n';
}*/
for (i = 1; i <= m; i++) {
f >> x >> y;
delta = (y-x+1);
z = log2[delta];
dif = delta - (1 << z);
g << min(sol[z][x], sol[z][x+dif]) << '\n';
}
return 0;
}