Cod sursa(job #3211075)
Utilizator | Data | 8 martie 2024 13:38:07 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,a[100001][20],x,y;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>a[i][0];
int lg=log2(n);
for(int j=1;j<=lg;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
a[i][j]=min(a[i][j-1],a[i+(1<<j-1)][j-1]);
for(int k=1;k<=m;k++)
{
fin>>x>>y;
int p=log2(y-x+1);
fout<<min(a[x][p],a[y-(1<<p)+1][p])<<'\n';
}
return 0;
}