Cod sursa(job #3253665)
| Utilizator | Data | 4 noiembrie 2024 09:42:06 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int r[20][100005],n,m,E[100005];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>r[0][i];
E[1]=0;
for(int i=2;i<=n;i++)
E[i]=E[i/2]+1;
for(int p=1;(1<<p)<=n;p++)
{
for(int i=1;i<=n;i++)
{
int j=i+(1<<(p-1));
if(j<=n)
r[p][i]=min(r[p-1][i],r[p-1][j]);
}
}
while(m--)
{
int x,y;
cin>>x>>y;
int e=E[y-x+1];
int len=(1<<e);
cout<<min(r[e][x],r[e][y-len+1])<<'\n';
}
return 0;
}
