Cod sursa(job #2529391)
| Utilizator | Data | 23 ianuarie 2020 12:52:59 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
#include <cmath>
using namespace std;
int n,m,nr,rmq[200000][19],in,sf;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n>>m;
for(int i=1;i<=n;i++) f>>rmq[i][0];
for(int j=1;(1<<j)<=n;j++)
{
for(int i=1;i+(1<<j)-1<=n;i++)
{
rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
}
}
for(int i=1;i<=m;i++)
{
f>>in>>sf;
int k=log2(sf-in+1);
g<<min(rmq[1+sf-(1<<k)][k], rmq[i][k])<<"\n";
}
return 0;
}