Pagini recente » Cod sursa (job #2055804) | Cod sursa (job #2311848) | Monitorul de evaluare | Cod sursa (job #1755385) | Cod sursa (job #2720045)
#include <fstream>
using namespace std;
ifstream fi("rmq.in");
ofstream fo("rmq.out");
int n, m, v[100001],a[20][100001];
void GenMat()
{
int i,j;
v[0] = v[1] = 0;
for (i = 2; i <= n; i++)
v[i] = v[i >> 1] + 1;
for (i = 1; i <= v[n]; i++)
for (j = 1; j + (1 << (i - 1)) <= n; j++)
a[i][j] = min(a[i - 1][j], a[i - 1][j + (1 << (i - 1))]);
}
int main()
{
int i,x,y,z;
fi >> n >> m;
for (i = 1; i <= n; i++)
fi >> a[0][i];
GenMat();
for (i = 1; i <= m; i++)
{
fi >> x >> y;
z = v[y- x + 1];
fo << min(a[z][x], a[z][y-(1<<z) + 1]) << '\n';
}
return 0;
}