Cod sursa(job #2097721)
| Utilizator | Data | 1 ianuarie 2018 14:47:28 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int N,M,x,y,RMQ[20][100001],lg[20];
int main()
{
f>>N>>M;
for(int i=1;i<=N;++i)f>>RMQ[0][i];
lg[1]=0;
for(int i=2;i<=N;++i)lg[i]=lg[i/2]+1;
for(int i=1;i<=lg[N];++i)
for(int j=1;j<=N;++j)
RMQ[i][j]=min(RMQ[i-1][j],RMQ[i-1][j+(1<<(i-1))]);
while(M--){
f>>x>>y;
int k=lg[y-x+1];
g<<min(RMQ[k][x],RMQ[k][y-(1<<k)+1])<<'\n';
}
return 0;
}
