Cod sursa(job #2984555)
| Utilizator | Data | 24 februarie 2023 14:18:07 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,a[20][100005];
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[0][i];
int lg=log2(n);
for(int i=1;i<=lg;i++)
{
int dr=(1<<i);
for(int j=1;j+dr<=n+1;j++)
a[i][j]=min(a[i-1][j],a[i-1][j+dr/2]);
}
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
if(x>y)
swap(x,y);
int dist=(y-x+1);
int lg=log2(dist);
g<<min(a[lg][x],a[lg][y-(1<<lg)+1])<<'\n';
}
return 0;
}
