Pagini recente » Cod sursa (job #1471231) | Cod sursa (job #2114967) | Cod sursa (job #1937652) | Cod sursa (job #1802854) | Cod sursa (job #1083117)
#include<fstream>
using namespace std;
int n,rmq[18][100010],lg[100010],v[100010],m,x,y,l,s,d;
int main () {
ifstream in("rmq.in");
ofstream out("rmq.out");
int i,j;
in>>n>>m;
for(i=1;i<=n;i++) {
in>>v[i];
rmq[0][i]=v[i];
}
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i=1;(1<<i)<=n;i++)
for (j=1;j<=n-(1<<i)+1;j++) {
l=1<<(i-1);
if(rmq[i-1][j]<rmq[i-1][j+1])
rmq[i][j]=rmq[i-1][j];
else
rmq[i][j]=rmq[i-1][j+l];
}
for(i=1;i<=m;i++) {
in>>x>>y;
d=y-x+1;
l=lg[d];
s=d-(1<<l);
if(rmq[l][x]<rmq[l][x+s])
out<<rmq[l][x]<<'\n';
else
out<<rmq[l][x+s]<<'\n';
}
in.close();
out.close();
return 0;
}