Cod sursa(job #2569638)
| Utilizator | Data | 4 martie 2020 12:58:37 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int N = 100010;
int n,m,i,p,P,st,mi,dr,rmq[17][N];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>rmq[0][i];
for(i=1,p=1,P=2;P<=n;i++,p*=2,P*=2)
for(st=1,mi=p+1,dr=P;dr<=n;st++,mi++,dr++)
rmq[i][st]=min(rmq[i-1][st],rmq[i-1][mi]);
for(;m;m--)
{
f>>st>>dr;
i=31-__builtin_clz(dr-st+1);
p=1<<i;
g<<min(rmq[i][st],rmq[i][dr-p+1])<<'\n';
}
return 0;
}
