Pagini recente » Cod sursa (job #2661797) | Cod sursa (job #1088123) | Rating ovidiu ustinescu (ovi2302) | Cod sursa (job #811103) | Cod sursa (job #3161434)
#include <bits/stdc++.h>
#define ll long long
#define MOD 1e9+7
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define LONG_MAX 1LL << 63
#define LONG_MIN -1LL << 63
#define INT_MAX 1<<31 -1
#define INT_MIN -1<<31 +1
using namespace std;
string fis="rmq";
ifstream fin(fis+".in");
ofstream fout(fis+".out");
int n , m;
int v[1005];
int r[17][100010] , E[100010];
int main()
{
fin >> n >> m;
for(int i = 1; i <= n ; ++i)
fin >> r[0][i];
for(int p =1 ; (1 << p) <= n ; ++p)
{
for(int i = 1; i <= n ; ++i)
{
r[p][i] = r[p - 1][i];
int j = (1 << (p - 1)) + i;
if(j <= n && r[p][i] > r[p - 1][j])
{
r[p][i] = r[p - 1][j];
}
}
}
E[1] = 0;
for(int i = 2 ; i<= n ; ++i)
E[i] = 1 + E[i / 2];
for(int q = 1 ; q <= m ; ++q)
{
int st , dr;
fin >> st >> dr;
int e = E[dr - st + 1];
int len = (1 << e);
fout << min(r[e][st] , r[e][dr - len + 1])<<"\n";
}
}