Cod sursa(job #2284650)
Utilizator | cosceex cosceex | Data | 17 noiembrie 2018 12:18:27 |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int RMQ[17][100001];
int main()
{
int n,m,x,y,s;
f>>n>>m;
for(int i=1;i<=n;i++)
f>>RMQ[0][i];
s=log2(n);
for(int i=1;i<=s;i++)
for(int j=1;j<=n;j++)
RMQ[i][j]=min(RMQ[i-1][j],RMQ[i-1][j+(1<<(i-1))]);
// for(int i=0;i<=log2(n);i++)
// {
// for(int j=1;j<=n;j++)
// g<<RMQ[i][j]<<" ";
// g<<'\n';
// }
for(int i=1;i<=m;i++){
f>>x>>y;
int p=log2(y-x+1);
g<<min(RMQ[p][x],RMQ[p][y-(1<<p)+1])<<'\n';
}
return 0;
}