Cod sursa(job #2854800)
| Utilizator | Data | 21 februarie 2022 19:31:21 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[100005][30];
int main()
{
int n,m;
fin.tie(0);
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>v[i][0];
}
for(int i=1;i<30;i++)
{
for(int j=1;j<=n;j++)
{
if(j+(1<<(i-1))<=n)
{
v[j][i]=min(v[j][i-1],v[j+(1<<(i-1))][i-1]);
}
}
}
for(int i=1;i<=m;i++)
{
int mn,mx;
fin>>mn>>mx;
int k=log2(mx-mn+1);
fout<<min(v[mn][k],v[mx-(1<<k)+1][k])<<endl;
}
return 0;
}
