Cod sursa(job #2392488)
Utilizator | Data | 30 martie 2019 08:59:49 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int d[100005][20],i,j,n,q,v[100005],a,b,p;
int main()
{
f>>n>>q;
for(i=1;i<=n;i++)
{
f>>v[i];
d[i][0]=v[i];
}
for(j=1;(1<<j)<=n;j++)
for(i=1;i+(1<<j)-1<=n;i++)
{
d[i][j]=min(d[i][j-1],d[i+(1<<j)][j-1]);
}
for(i=1;i<=q;i++)
{
f>>a>>b;
p=log2(b-a+1)-1;
g<<min(d[a][p],d[b-(1<<p)+1][p])<<'\n';
}
return 0;
}