Cod sursa(job #2373127)
| Utilizator | Data | 7 martie 2019 12:23:09 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int lg[100010],mat[20][100010],n,m,x,y,a[100010];
int main()
{
f>>n>>m;
for(int i=1;i<=n;++i) f>>mat[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){
mat[i][j]=min(mat[i-1][j],mat[i-1][j+(1<<(i-1))]);
}
}
for(int i=1;i<=m;++i){
f>>x>>y;
int k=lg[y-x+1];
g<<min(mat[k][x],mat[k][y-(1<<k)+1])<<'\n';
}
}
