Pagini recente » Cod sursa (job #3002816) | Cod sursa (job #2735209) | Cod sursa (job #3131147) | Cod sursa (job #2341507) | Cod sursa (job #1262449)
# include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int v[100001];
int lg[100001];
int rmq[18][100001];
int main()
{
int n,m,i,j,l;
in>>n>>m;
for (i=1;i<=n;i++) in>>v[i];
lg[1]=0;
for (i=2;i<=n;i++) lg[i]=lg[i/2]+1;
for (i=1;i<=n;i++) rmq[0][i]=v[i];
for (i=1;(1<<i)<=n;i++)
{
for (j=1;j<=n-(1<<i)+1;j++)
{
l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
}
}
long int x,y,diff,sh;
for (i=1;i<=m;i++)
{
in>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff - (1<<l);
out<<min(rmq[l][x],rmq[l][x+sh])<<'\n';
}
return 0;
}