Cod sursa(job #3286671)
| Utilizator | Data | 14 martie 2025 15:16:17 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int rmq[33][100005],lgm[100005];
int main()
{
int n,m,l;
in>>n>>m;
for(int i=1;i<=n;i++){
in>>rmq[0][i];
if(i>1)
lgm[i]=1+lgm[(i>>1)];
}
for(int i=1;i<=lgm[n];i++){
for(int j=(1<<i);j<=n;j++){
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j-(1<<(i-1))]);
}
}
int x,y;
while(m--){
in>>x>>y;
l=lgm[y-x+1];
out<<min(rmq[l][x+(1<<l)-1],rmq[l][y]);
}
return 0;
}
