Cod sursa(job #2864790)
Utilizator | Data | 8 martie 2022 11:13:33 | |
---|---|---|---|
Problema | Range minimum query | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int isp2(int diff)
{
int l=log2(diff);
if(diff==1<<l)
l--;
return l;
}
int n,m,i,p2[20],lg[100011],rmq[100011][20],l,j,x,y;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>rmq[i][0];
for(i=1;1<<i<=n;i++)
for(j=1;j<=n-(1<<i)+1;j++)
rmq[j][i]=min(rmq[j][i-1],rmq[j+(1<<(i-1))][i-1]);
for(i=1;i<=m;i++)
{
f>>x>>y;
l=isp2(y-x+1);
g<<min(rmq[x][l],rmq[y-(1<<l)+1][l])<<'\n';
}
return 0;
}