Pagini recente » Cod sursa (job #2449629) | Cod sursa (job #1099653) | Cod sursa (job #1419867) | Cod sursa (job #661326) | Cod sursa (job #3213909)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int e[100005];
int rmq[18][100005];
int n, m;
void MakeE()
{
int i;
e[1] = 0;
for(i = 2; i <= 100005; i++)
e[i] = 1 + e[i / 2];
}
void Rmq()
{
int l, i, j;
for(i = 1; i <= e[n]; i++)
{
l = (1 << i);
for(j = 1; j <= n - l + 1; j++)
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l / 2]);
}
}
int main()
{
ios_base::sync_with_stdio(0);
fin.tie(0);
fout.tie(0);
int i, j, l, expo, x, y;
fin >> n >> m;
for(i = 1; i <= n; i++)
fin >> rmq[0][i];
MakeE();
Rmq();
for(i = 1; i <= m; i++)
{
fin >> x >> y;
expo = (y - x + 1);
l = (1 << e[expo]);
fout << min(rmq[expo][x], rmq[expo][y - l + 1]) << "\n";
}
return 0;
}