Pagini recente » Cod sursa (job #301733) | Cod sursa (job #67462) | Cod sursa (job #527490) | Cod sursa (job #1007858) | Cod sursa (job #2906307)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int N=1e5+2;
const int LOG=17;
int log[N];
int v[N], r[LOG][N];
int main()
{
int n, m;
in>>n>>m;
for(int i=1; i<=n; i++){
in>>v[i];
r[0][i]=v[i];
}
log[1]=0;
for(int i=2; i<=n; i++)
log[i]=1+log[i/2];
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 l=dr-st+1;
int e=log[l];
int rez=min(r[e][st+(1<<e)-1], r[e][dr]);
out<<rez<<'\n';
}
return 0;
}