Cod sursa(job #1984182)
| Utilizator | Data | 23 mai 2017 22:18:07 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,x,y,l,k,j;
int rmq[100010][17];
int log[100010];
int main()
{
fin>>n>>m;
for(i=1;i<=n;++i) fin>>rmq[i][0];
for(i=2;i<=n;++i) log[i]=log[i>>1]+1;
for(k=1;(1<<k)<=n;++k)
for(j=1;j+(1<<k)-1<=n;++j)
{
rmq[j][k]=min(rmq[j][k-1],rmq[j+(1<<(k-1))][k-1]);
}
for(;m;--m)
{
fin>>x>>y;
l=log[y-x+1];
fout<<min(rmq[x][l],rmq[y-(1<<l)+1][l])<<'\n';
}
return 0;
}
