Pagini recente » Cod sursa (job #2372303) | Cod sursa (job #1903064) | Cod sursa (job #1866343) | Cod sursa (job #1343007) | Cod sursa (job #2564152)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int a[100005],q,n,rmq[100005][30],lg[100005],x,y,l;
int main()
{
f>>n>>q;
for(int i=1;i<=n;i++)
f>>a[i];
lg[1]=0;
for(int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(int i=1;i<=n;i++)
rmq[i][0]=a[i];
for(int j=1;j<=lg[n];j++)
{
int put=(1<<j);
for(int i=1;i+put-1<=n;i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+put/2][j-1]);
}
while(q--)
{
f>>x>>y;
l=lg[y-x+1];
g<<min(rmq[x][l],rmq[y-(1<<l)+1][l])<<endl;
}
}