Pagini recente » Cod sursa (job #1983531) | Cod sursa (job #3258314) | Cod sursa (job #2819540) | Cod sursa (job #1336063) | Cod sursa (job #3154331)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout("rmq.out");
int rmq[18][100001];
int main()
{
int n,m;
fin>>n>>m;
for (int i=0;i<n;i++)
fin>>rmq[0][i];
for (int i=1,lg=2;lg<=n;lg<<=1,i++)
for (int j=0; j<=n-lg; j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for (int i=0; i<m; i++) {
int a,b;
fin>>a>>b;
a--,b--;//pentru ca avem indici bazati pe 1
int lg=b-a+1;
int p;
for (p=1;(1<<p)<=lg;p++);p--;
fout<<min(rmq[p][a],rmq[p][b-(1<<p)+1])<<endl; //hmm
}
return 0;
}