Cod sursa(job #2617592)
Utilizator | Data | 22 mai 2020 13:04:15 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
int n,m,v[100009][18];
ifstream f("rmq.in");
ofstream g("rmq.out");
int main()
{
f>>n;
f>>m;
for(int i=1; i<=n; i++)
f>>v[i][0];
for(int j=1;j<=18;j++)
{
for(int i=1;i<=n-(1<<(j))+1;i++)
{
v[i][j]=min(v[i][j-1],v[i+(1<<(j-1))][j-1]);
}
}
for (int i=1;i<=m;++i)
{
int a,b;
f>>a>>b;int lg=log2(b-a+1);
g<<min(v[a][lg],v[b-(1<<lg)+1][lg])<<"\n";
}
return 0;
}