Cod sursa(job #1961921)
| Utilizator | Data | 11 aprilie 2017 14:26:04 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#define VAL 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,rmq[20][VAL],lg,l[VAL],a,b;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)fin>>rmq[0][i];
for(int i=2;i<VAL;i++)l[i]=l[i/2]+1;
for(int pd=1;pd<=l[n];pd++)
for(int i=1;i<=n-(1<<(pd))+1;i++)
rmq[pd][i]=min(rmq[pd-1][i],rmq[pd-1][i+(1<<(pd-1))]);
for(int i=1;i<=m;i++)
{
fin>>a>>b;
lg=l[b-a+1];
fout<<min(rmq[lg][a],rmq[lg][b-(1<<lg)+1])<<'\n';
}
return 0;
}
