Pagini recente » Cod sursa (job #1394379) | Cod sursa (job #2915201) | Cod sursa (job #2618989) | Cod sursa (job #1492982) | Cod sursa (job #2211404)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,i,j,p,P,st,dr,mi,x,y,lg,sol,rmq[17][100001],b[100001];
int main()
{
f>>n>>m;
for(j=1;j<=n;j++)
f>>rmq[0][j];
p=1;
P=2;
i=0;
while(P<=n)
{
i++;
for(st=1,dr=P,mi=p+1;dr<=n;st++,dr++,mi++)
rmq[i][st]=min(rmq[i-1][st],rmq[i-1][mi]);
p*=2;
P*=2;
}
for(p=2;p<=n;p*=2)
b[p]=1;
for(j=2;j<=n;j++)
b[j]+=b[j-1];
for(;m;m--)
{
f>>x>>y;
lg=y-x+1;
i=b[lg];
p=1<<i;
sol=min(rmq[i][x],rmq[i][y-p+1]);
g<<sol<<"\n";
}
return 0;
}