Pagini recente » Cod sursa (job #1393914) | Cod sursa (job #134538) | Cod sursa (job #1706259) | Cod sursa (job #2645087) | Cod sursa (job #2590420)
#include <fstream>
using namespace std;
int n,m,v[100010],rmq[100010][32],x,y,pmax,p,mn,log2[100010];
int main() {
ifstream f ("rmq.in");
ofstream g ("rmq.out");
f >> n >> m;
while((1<<(pmax+1))<=n) pmax++;
for(int i=1; i<=n; i++) {
f >> v[i];
rmq[i][0]=v[i];
}
for(int j=1; (1<<j)<=n; j++)
for(int i=1; i<=n-(1<<j)+1; i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
for(int i=2;i<=n;i++){
log2[i]=log2[i/2]+1;
}
for(int i=1; i<=m; i++) {
f >> x >> y;
g << min(rmq[x][log2[y-x+1]],rmq[y-(1<<log2[y-x+1])+1][log2[y-x+1]])<<"\n";
}
return 0;
}