Cod sursa(job #2624865)
Utilizator | Stefan Sevastre @stefansevastre@ | Data | 5 iunie 2020 15:59:00 |
---|---|---|---|
Problema | Range minimum query | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
int n,m,rmq[100005][20];
int a,b,i,j;
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)
f>>rmq[i][0];
for(i=1; i<20; i++)
for(j=1; j<n-(1<<(i))+1; j++)
rmq[j][i]=min(rmq[j][i-1], rmq[j+(1<<(i-1))][i-1]);
for(i=0; i<m; i++)
{
f>>a>>b;
int poz=log2(b-a+1);
g<<min(rmq[a][poz],rmq[b-(1<<poz)+1][poz])<<endl;
}
return 0;
}