Cod sursa(job #2476537)
Utilizator | Diana M MDiana15 | Data | 19 octombrie 2019 08:33:22 |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int d[100001][40],n,m,j,i,a,b;
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
f>>d[i][0];
}
for(int j=1; (1<<j)<=n;j++)
for(int i=1; i+(1<<j)-1<=n; i++)
{
d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
}
for(int i=1;i<=m;i++)
{
f>>a>>b;
int x=log2(b-a+1);
g<<min(d[a][x],d[b-(1<<x)+1][x])<<'\n';
}
return 0;
}