Cod sursa(job #1427170)
Utilizator | Butnaru George Butnaru | Data | 1 mai 2015 17:23:30 |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n,m,rmq[17][100001],x,y,aux,i,j,v[100001],dif;
int main(){
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
for (i=1;i<=n;i++) fin>>rmq[0][i];
for (i=1;1<<i<=n;i++){
aux=1<<(i-1);
for (j=1;j+aux<=n;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+aux]);
}
for (i=2;i<=n;i++) v[i]=v[i/2]+1;
for (i=1;i<=m;i++){
fin>>x>>y;
dif=v[y-x+1]; aux=1<<dif;
fout<<min(rmq[dif][x],rmq[dif][y-aux+1])<<"\n";
}
return 0;
}