Cod sursa(job #2835498)
Utilizator | Carina Maria Viespescu carinamaria | Data | 18 ianuarie 2022 19:58:11 |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int r[20][100005], i, j, n, m, v[100005], p, len, st, dr, x;
int main() {
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>r[0][i];
for(i=1;(1<<i)<=n;i++){
for(j=1;j<=n;j++){
r[i][j]=r[i-1][j];
int p=j+(1<<(i-1));
if(p<=n && r[i][j]>r[i-1][p])
r[i][j]=r[i-1][p];
}
}
v[1]=0;
for(i=2;i<=n;i++){
v[i]=v[i/2]+1;
}
for (i=1;i<=m;i++){
cin>>st>>dr;
x=v[dr-st+1];
len=(1<<x);
cout<<min(r[x][st],r[x][dr-len+1])<<"\n";
}
}