Pagini recente » Cod sursa (job #28043) | Cod sursa (job #614460) | Cod sursa (job #2330320) | Cod sursa (job #856965) | Cod sursa (job #2488242)
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int v[100001],r[17][100001],log[100001];
int main()
{
int n,m,l,p,q;
in>>n>>m;
for(int i=1; i<=n; i++)
in>>v[i];
for(int j=1; j<=n; j++)
r[0][j]=v[j];
for(int i=1; (1<<i)<=n; i++)
for(int j=1; j+(1<<i)<=n+1; j++)
r[i][j]=min(r[i-1][j],r[i-1][j+(1<<(i-1))]);
for(int i=1; i<=m; i++)
{
in>>p>>q;
l=log[q-p+1];
out<<min(r[l][p],r[l][q-(1<<l)+1])<<"\n";
}
return 0;
}