Pagini recente » Cod sursa (job #3210883) | Monitorul de evaluare | Cod sursa (job #1357461) | Cod sursa (job #3197044) | Cod sursa (job #2556334)
#include <iostream>
#include <fstream>
#define N 100002
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m;
int log2[N],d[23][N];
int a,b,k;
void citire()
{
f>>n>>m;
for(int i=1;i<=n;i++)
f>>d[0][i];
}
void f_loga2()
{
log2[1]=0;
for(int i=2;i<=n;i++)
log2[i]=log2[i/2]+1;
}
void solve()
{
for(int i=1;i<=log2[n];i++)
for(int j=1;j<=n-(1<<(i-1));j++)
d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
for(int i=1;i<=m;i++)
{
f>>a>>b;
k=log2[b-a+1];
g<<min(d[k][a],d[k][b-(1<<k)+1])<<'\n';
}
}
int main()
{
citire();
f_loga2();
solve();
}