Pagini recente » Cod sursa (job #529033) | Cod sursa (job #509340) | Cod sursa (job #682425) | Cod sursa (job #1509733) | Cod sursa (job #2837578)
#include <fstream>
#define INF 1000000000
using namespace std;
ifstream fin ("rmq.in");
ofstream fout("rmq.out");
int v[17][100010], E[100010];
int n, m, i, j, st, dr, minim, p, e, len;
int main () {
fin>>n>>m;
for (i = 1;i <= n;i++)
fin>>v[0][i];
for (p = 1;(1 << p) <= n;p++)
for (i = 1;i <= n;i++) {
v[p][i] = v[p - 1][i];
j = i + (1 << (p - 1));
if (j <= n && v[p][i] > v[p - 1][j])
v[p][i] = v[p - 1][j];
}
E[1] = 0;
for(i = 2;i <= n;i++)
E[i] = 1 + E[i / 2];
for(i = 1;i <= m;i++){
fin>>st>>dr;
len = (1 << E[dr - st + 1]);
fout<<min(v[E[dr - st + 1]][st], v[E[dr - st + 1]][dr - len + 1])<<"\n";
}
}