Pagini recente » Cod sursa (job #3192855) | Cod sursa (job #2896221) | Cod sursa (job #562598) | Cod sursa (job #1456136) | Cod sursa (job #2906303)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int N=10e5;
const int L=17;
int log[N], r[L][N], v[N];
int main()
{
int n,m;
in>>n>>m;
for (int i=1;i<=n;i++)
{
in>>v[i];
}
log[1]=0;
for (int i=2;i<=n;i++)
{
log[i]=1+log[i/2];
}
for (int i=1;i<=n;i++)
{
r[0][i]=v[i];
}
for(int i=1;(1<<i)<=n;i++)
{
for(int j=1;j<=n;j++)
{
int p=1<<(i-1);
r[i][j]=min(r[i-1][j-p],r[i-1][j]);
}
}
int st, dr;
for(int i=1;i<=m;i++)
{
in>>st>>dr;
int t=dr-st+1;
int e=log[t];
int rez=min(r[e][st+(1<<e)-1],r[e][dr]);
out<<rez<<"\n";
}
return 0;
}