Pagini recente » Cod sursa (job #2546311) | Cod sursa (job #988011) | Cod sursa (job #611103) | Borderou de evaluare (job #1408727) | Cod sursa (job #2143523)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,a[22][100002],v[100005],m,x,y,h,r,rez;
void RMQ()
{
h=1;
for(int i=1;(1<<i)<=n;++i)
{
r=h; h*=2;
for(int j=1;j<=n-h+1;++j)
{
if(v[a[i-1][j]]<v[a[i-1][j+r]]) a[i][j]=a[i-1][j];
else a[i][j]=a[i-1][j+r];
}
}
}
int main()
{
f>>n>>m;
for(int j=1;j<=n;++j)
{
f>>v[j];
a[0][j]=j;
}
RMQ();
for(int i=1;i<=m;++i)
{
f>>x>>y;
h=y-x+1;
r=log2(h);
h=h-(1<<r);
rez=min(v[a[r][x]],v[a[r][x+h]]);
g<<rez<<'\n';
}
return 0;
}