Pagini recente » Cod sursa (job #2825387) | Cod sursa (job #2972841) | Cod sursa (job #1743462) | Cod sursa (job #859565) | Cod sursa (job #1414337)
#include <fstream>
#define NMax 100010
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, rmq[18][NMax], i, j, lg[100010], st, dr;
int getmin(int a, int b)
{
if (a < b)
return a;
return b;
}
int main()
{
f >> n >> m;
for (int i = 1; i <= n; i++)
f >> rmq[0][i];
lg[1] = 0;
lg[2] = 1;
for (int i = 3; i <= n; i++)
lg[i] = lg[i / 2] + 1;
for (int i = 1; i <= lg[n]; i++)
for (int j = 1; j <= n - lg[i] + 1; j++)
rmq[i][j] = getmin(rmq[i-1][j], rmq[i-1][j + (1<<(i-1))]);
for (int i = 1; i <= m; i++) {
f >> st >> dr;
g << getmin(rmq[lg[dr - st + 1]][st], rmq[lg[dr - st + 1]][st + (dr - st + 1) - (1 << lg[dr - st + 1])]) << "\n";
}
return 0;
}