Cod sursa(job #3266619)
| Utilizator | Data | 9 ianuarie 2025 16:46:52 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,m,lg[200005],x,y,rmq[32][200005];
int main()
{
cin>>n>>m;
for(int i=2;i<=n;i++)
lg[i]=lg[i>>1]+1;
for(int i=0;i<n;i++)
cin>>rmq[0][i+1];
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n-(1<<i)+1;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for(int i=1;i<=m;i++)
{
cin>>x>>y;
if(x>y) swap(x,y);
int k=lg[y-x+1];
cout<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
}
}
