Pagini recente » Cod sursa (job #1594812) | Cod sursa (job #1338780) | Cod sursa (job #2455398) | Cod sursa (job #2178354) | Cod sursa (job #1452338)
#include<fstream>
using namespace std;
int n, q, x[20][100003], y[100003],i, j, p, q1, q2;
ifstream in("rmq.in");
ofstream out("rmq.out");
int main(){
in>>n>>q;
for(i=1; i<=n; i++)
in>>x[0][i];
for(i=2; i<=n; i++)
y[i]=1+y[i/2];
for(i=1; (1<<i)<=n; i++){
for(j=1; j<=n; j++)
x[i][j]=min(x[i-1][j], x[i-1][j+(1<<(i-1))]);
}
for(;q--;){
in>>q1>>q2;
p=y[q2-q1];
out<<min(x[p][q1], x[p][q2-(1<<p)+1])<<"\n";
}
return 0;
}