Pagini recente » Cod sursa (job #3275232) | Cod sursa (job #1315837) | Cod sursa (job #2380633) | Cod sursa (job #236143) | Cod sursa (job #1190181)
#include<fstream>
using namespace std;
int x, y, p, n, i, j, m, v[100003], d[17][100003];
int minim(int x, int y){
return x<y?x:y;
}
ifstream in("rmq.in");
ofstream out("rmq.out");
int main(){
in>>n>>m;
for(i=1; i<=n; i++)
in>>d[0][i];
for(i=2; i<=n; i++)
v[i]=1+v[i>>1];
for(i=1; (1<<i)<=n; i++)
for(j=1; j<=n; j++)
d[i][j]=minim(d[i-1][j], d[i-1][j+(1<<(i-1))]);
for(i=1; i<=m; i++){
in>>x>>y;
p=v[y-x+1];
out<<minim(d[p][x], d[p][y-(1<<p)+1])<<"\n";
}
return 0;
}