Pagini recente » Cod sursa (job #701689) | Cod sursa (job #2963332) | Cod sursa (job #1136407) | Cod sursa (job #2424338) | Cod sursa (job #3139592)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define NMAX 100005
int dp[20][NMAX];
int log2[NMAX];
int main()
{
int n, m;
fin >> n >> m;
for (int i = 1; i <= n; ++i)
fin >> dp[0][i];
log2[1] = 0;
for (int i = 2; i <= n; ++i)
log2[i] = log2[i / 2] + 1;
for (int i = 1; (1 << i) <= n; ++i)
for (int j = 1; j <= n - (1 << i) + 1; ++j)
{
int putere = 1 << (i - 1);
if (dp[i - 1][j] < dp[i - 1][j + putere])
dp[i][j] = dp[i - 1][j];
else
dp[i][j] = dp[i - 1][j + putere];
}
for (int i = 1; i <= m; ++i)
{
int x, y;
fin >> x >> y;
int dif = y - x + 1;
int log = log2[dif];
int putere = (1 << log);
if (dp[log][x] < dp[log][y - putere + 1])
fout << dp[log][x] << '\n';
else
fout << dp[log][y - putere + 1] << '\n';
}
return 0;
}