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