Cod sursa(job #1887979)
Utilizator | Soltan Gheorghe cyber_gh | Data | 21 februarie 2017 21:02:56 |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N,M,rmq[100010][22];
int main(){
fin >>N>>M;
for (int i=0;i<N;i++){
fin >>rmq[i][0];
}
for (int j=1;(1<<j)<=N;j++){
for (int i=0;i+(1<<(j))-1<N;i++){
rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
}
}
for (int i=0;i<M;i++){
int x,y,l,k;
fin >>x>>y;
x--;y--;
l=y-x+1;
k=int(log2(l));
int dif=l-(1<<k);
fout <<min(rmq[x][k],rmq[x+dif][k])<<"\n";
}
return 0;
}