Cod sursa(job #2146870)
Utilizator | Mihalut Filip filip.mihalut | Data | 28 februarie 2018 11:54:06 |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
#define Nmax 100005
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
int n,m,i,j,t,k,v[18][Nmax],x,y;
int main()
{
f >> n >> t;
for(i = 1;i <= n;i++)
f >> v[0][i];
k = 1;
m = log2(n);
for(i = 1;i <= m;i++)
{
for(j = 1;j <= n - 2*k + 1;j++)
v[i][j] = min(v[i - 1][j],v[i - 1][j + k]);
k *= 2;
}
for(i = 1;i <= t;i++)
{
f >> x >> y;
m = log2(y - x + 1);
k = pow(2,m);
g << min(v[m][x],v[m][y - k + 1]) << '\n';
}
return 0;
}