Pagini recente » Cod sursa (job #2598683) | Cod sursa (job #675159) | Cod sursa (job #1095210) | Cod sursa (job #630986) | Cod sursa (job #3003058)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(WHATEVER) for(int i = 1; i <= WHATEVER; ++ i)
/// INPUT / OUTPUT
const string problem = "rmq";
ifstream fin(problem + ".in");
ofstream fout(problem + ".out");
/// GLOBAL VARIABLES
const ll NMAX = 1e5+5, MOD = 1e9 + 7, INF = 1e9;
int n, q;
int arr[NMAX];
int rmq[18][NMAX];
/// READING THE INPUT
int main()
{
ios::sync_with_stdio(false);
fin.tie(NULL);
fout.tie(NULL);
fin >> n >> q;
for(int i = 1; i <= n; ++ i)
fin >> rmq[0][i];
for(int i = 1; (1 << i) <= n; ++ i)
{
for(int j = 1; j <= n; ++ j)
{
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1 << (i - 1))]);
}
}
while(q--)
{
int a, b;
fin >> a >> b;
int k = log2(1 + b - a);
fout << min(rmq[k][a], rmq[k][1 + b - (1<<k)]) << '\n';
}
}