Cod sursa(job #2922280)
| Utilizator | Data | 7 septembrie 2022 18:25:20 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include<fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int a[17][100010],b[100010];
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[0][i];
for( int p=1;(1<<p)<=n;p++)
for(int i=1;i<=n;i++)
{
a[p][i]=a[p-1][i];
int j=i+(1<<(p-1));
if(j<=n&&a[p][i]>a[p-1][j])
a[p][i]=a[p-1][j];
}
for(int i=2;i<=n;i++)
b[i]=1+b[i/2];
int x,y;
for(;m;m--)
{
cin>>x>>y;
int e=b[x-y+1];
int lung=(1<<e);
cout<<min(a[e][x],a[e][y-lung+1])<<'\n';
}
}