Cod sursa(job #2483892)
Utilizator | Data | 30 octombrie 2019 15:27:50 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int r[17][100005],log[100005];
int main()
{
int n,m,p,q;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>r[0][i];
}
for(int i=1;(1<<i)<=n;i++){
for(int j=0;j+(1<<i)<=n;j++){
r[i][j]=min(r[i-1][j],r[i-1][j+(1<<(i-1))]);
}
}
log[1]=0;
for(int i=2;i<=n;i++){
log[i]=1+log[i/2];
}
for(int i=1;i<=m;i++){
cin>>p>>q;
p--;
q--;
int l=log[q-p+1];
cout<<min(r[l][p],r[l][q-(1<<l)+1])<<'\n';
}
return 0;
}