Cod sursa(job #2372557)
| Utilizator | Data | 7 martie 2019 09:53:43 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-32 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#define NMAX 100005
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int n,m,d[NMAX][NMAX];
int main()
{
fin>>n>>m;
for (int i=1;i<=n;i++)
fin>>d[0][i];
for (int i=1;(1<<i)<=n;i++)
for (int j=1;j<=n-(1<<i)+1;j++)
d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
for (int v=0;v<m;v++)
{
int x,y,k;
fin>>x>>y;
for (k=1;(1<<k)<=y-x;k++);
k--;
fout<<min(d[k][x],d[k][y-(1<<k)+1])<<'\n';
}
return 0;
}
