Cod sursa(job #3312708)
| Utilizator | Data | 29 septembrie 2025 16:46:06 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <cmath>
using namespace std;
int n,m,a[100005],x,y,rmq[100005][20];
void precalc()
{
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
}
int query(int x, int y)
{
int k=log2(y-x+1);
int rez=min(rmq[x][k], rmq[y-(1<<k)+1][k]);
return rez;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>a[i];
rmq[i][0]=a[i];
}
precalc();
for(int i=1;i<=m;i++)
{
cin>>x>>y;
cout<<query(x,y)<<endl;
}
return 0;
}
