Pagini recente » Cod sursa (job #833889) | Cod sursa (job #1064258) | Cod sursa (job #2422222) | Cod sursa (job #2365003) | Cod sursa (job #2502275)
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m;
int rmq[20][NMAX];
int lg[NMAX];
int main()
{
int x, y, i, j, k;
f >> n >> m;
lg[1] = 0;
for(i = 2; i <= n; i++)
{
lg[i] = lg[i>>1] + 1;
}
for(i = 1;i <= n; i++)
{
f >> rmq[0][i];
}
for(i = 1;(1<<i) <= n; i++)
{
for(j = 1; j <= n - (1<<i) + 1; j++)
{
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
}
}
for(i = 1; i <= m; i++)
{
f >> x >> y;
if(x > y)
swap(x,y);
k = lg[y-x+1];
g << min(rmq[k][x],rmq[k][y-(1<<k)+1]) << '\n';
}
return 0;
}