Cod sursa(job #2932399)
| Utilizator | Data | 2 noiembrie 2022 19:47:04 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
int v[100005][17];
int log(int nr){
int k=0;
while(1<<(k+1)<=nr) k++;
return k;
}
int main()
{
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,m,LOG,L,R,len,L2;
cin >> n >> m;
for(int i=1;i<=n;i++) {cin >> v[i][0];}
LOG=log(n);
for(int j=1;j<=LOG;j++){
for(int i=1;i+(1<<j)-1<=n;i++) {v[i][j]=min(v[i][j-1] , v[i+(1<<(j-1))][j-1]);}
}
for(int i=0;i<m;i++){
cin >> L >> R;
L2=log(R-L+1);
cout << min(v[L][L2] , v[R-(1<<L2)+1][L2]) << '\n';
}
return 0;
}