Cod sursa(job #2713391)
Utilizator | Andries Vlad Andrei vladad | Data | 27 februarie 2021 20:39:12 |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, q, rmq[25][200001], lg[200201], nr, v[200001];
int main()
{
f>>n>>q;
for(int i=1; i<=n; i++)
f>>v[i];
for(int i=1; i<=n; i++)
rmq[0][i]=v[i];
for(int i=2; i<=n; i++)
lg[i]=lg[i/2]+1;
for(int i=1; i<=lg[n]; i++)
for(int j=1; j<=n; j++)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
for(; q; q--)
{
int x, y;
f>>x>>y;
int nr=lg[y-x+1];
g<<min(rmq[nr][x], rmq[nr][y-(1<<nr)+1])<<'\n';
}
return 0;
}