Pagini recente » Cod sursa (job #140819) | Cod sursa (job #3003630) | Cod sursa (job #2575646) | Cod sursa (job #2591321) | Cod sursa (job #3247283)
#include <bits/stdc++.h>
using namespace std;
int rmq[100005][31], logar[100005], v[100005];
int p2(int a)
{
return (1<<(a));
}
int main()
{
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n, m, a, b;
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>v[i], rmq[i][0] = v[i];
for(int i=2; i<=n; i++)
logar[i] = logar[i/2]+1;
for(int i=1; i<=logar[n]; i++)
{
for(int j=1;j<=n;j++)
{
if(j+p2(i-1) > n)
break;
rmq[j][i] = min(rmq[j][i-1], rmq[j+p2(i-1)][i-1]);
}
}
for(int i=1; i<=m; i++)
{
cin>>a>>b;
int aux = b - a + 1;
cout<<min(rmq[a][logar[aux]], rmq[b+1-p2(logar[aux])][logar[aux]])<<'\n';
}
return 0;
}