Pagini recente » Cod sursa (job #2209686) | Cod sursa (job #3212068) | Cod sursa (job #1290755) | Cod sursa (job #311970) | Cod sursa (job #2589967)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,v[100005],log2[100005],d[100005][20],x,y,m;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>v[i];
d[i][0]=v[i];
}
for(int j=1;(1<<j)<=n;j++){
for(int i=1;i<=n-(1<<j)+1;i++){
d[i][j]= min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
}
}
for(int i=2;i<=n;i++){
log2[i]=log2[i/2]+1;
}
while(m--){
cin>>x>>y;
cout<<min(d[x][log2[y-x+1]],d[y-(1<<log2[y-x+1])+1][log2[y-x+1]])<<'\n';
}
return 0;
}
/*5 4
1 3 18 2 3
1 5
2 3
3 4
2 4
*/