Pagini recente » Borderou de evaluare (job #2674983) | Cod sursa (job #2890022)
#include<fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int rmq[20][100005];
int LOG2[100005];
int main()
{
int n, t; cin >> n >> t;
for(int i = 1; i <= n; i++)
{
cin >> rmq[0][i];
}
for(int i = 1; (1 << i) <= n; i++)
{
for(int j = 1; j <= n - (1 << i) + 1; j++)
{
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}
}
for(int i = 2; i <= n; i++)
{
LOG2[i] = LOG2[i / 2] + 1;
}
for(int i = 0; i < 6; i++)
{
for(int j = 1; j <= n; j++)
{
cout << rmq[i][j] << " ";
}
cout << '\n';
}
while(t--)
{
int x, y;
cin >> x >> y;
int poz = LOG2[y - x + 1];
cout << min(rmq[poz][x], rmq[poz][y - (1 << poz) + 1]) << '\n';
}
return false;
}