Cod sursa(job #2266050)
Utilizator | Avram Rares Stefan avramrares | Data | 22 octombrie 2018 09:48:30 |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int d[17][100001],i,j,x,y,k,m,n;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>d[0][i];
for(i=1;i<=log2(n);i++)
for(j=1;j<=n-(1<<i)+1;j++)
d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
for(i=1;i<=m;i++)
{
f>>x>>y;
if(x==y)
g<<d[0][x]<<'\n';
else
{
k=log2(y-x);
g<<min(d[k][x],d[k][y-(1<<k)+1])<<'\n';
}
}
return 0;
}