Pagini recente » Cod sursa (job #2386794) | Cod sursa (job #2800704) | Cod sursa (job #2506847) | Cod sursa (job #1795504) | Cod sursa (job #2349132)
#include <iostream>
#include <fstream>
#define log_2 18
#define D 100005
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int v[log_2][D];
int main()
{
int n,m,i,j,a,b,dif,p2;
f>>n>>m;
for(i=1;i<=n;i++)
f>>v[0][i];
for(i=1;(1<<i)<n;i++)
for(j=1;j<=n-(1<<i)+1;j++)
v[i][j]=min(v[i-1][j],v[i-1][j+(1<<(i-1))]);
for(i=1;i<=m;i++)
{
f>>a>>b;
dif=b-a+1;
p2=1;j=0;
while(p2*2<=dif)
p2=p2*2,j++;
g<<min(v[j][a],v[j][b-p2+1])<<"\n";
}
}