Pagini recente » Cod sursa (job #173808) | Cod sursa (job #929852) | Cod sursa (job #2846445) | Cod sursa (job #241548) | Cod sursa (job #1452314)
#include<fstream>
using namespace std;
int n, q, i, j, b[100003], x[20][100003], y[100003], q1, q2, q3;
ifstream in("rmq.in");
ofstream out("rmq.out");
int main(){
in>>n>>q;
for(i=1; i<=n; i++)
in>>b[i];
for(i=1; i<=n; i++)
x[0][i]=b[i];
for(i=1; i*i<=n; i++)
for(j=1; j<=n; j++){
if(j+(1<<(i-1))<=n)
x[i][j]=min(x[i-1][j], x[i-1][j+(1<<(i-1))]);
else
x[i][j]=min(x[i-1][j], x[i-1][n]);
}
y[1]=0;
for(i=2; i<=n; i++)
y[i]=1+y[i/2-1];
for(;q--;){
in>>q1>>q2;
q3=q2-q1;
out<<min(x[y[q3]][q1], x[y[q3]][q2-q3+1])<<"\n";
}
return 0;
}