Cod sursa(job #2485980)
| Utilizator | Data | 2 noiembrie 2019 10:58:57 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,mat[100005][100005],l[100005];
int main()
{
f>>n>>m;
for(int i=1;i<=n;++i)
f>>mat[0][i];
l[0]=l[1]=0;
for(int i=2;i<=n;++i)
l[i]=l[i>>1]+1;
for(int i=1;i<=l[n];++i)
for(int j=1;j+(1<<(i-1))<=n;++j)
mat[i][j]=min(mat[i-1][j],mat[i-1][j+(1<<(i-1))]);
while(m--)
{
int x,y,l2;
f>>x>>y;
l2=l[y-x+1];
g<<min(mat[l2][x],mat[l2][y-(1<<l2)+1])<<'\n';
}
g.close();
f.close();
return 0;
}
