Cod sursa(job #2373941)
Utilizator | Data | 7 martie 2019 16:03:48 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int dp[32][100005],lg[100005];
int main()
{
int n,m,i,j;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>dp[0][i];
for(i=2;i<=100000;i++)
lg[i]=lg[i/2]+1;
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n-(1<<i)+1;j++)
dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
int x,y;
for(i=1;i<=m;i++)
{
fin>>x>>y;
int dif=y-x+1,li,co;
li=lg[dif];
co=dif-(1<<li);
fout<<min(dp[li][x],dp[li][co+x])<<'\n';
}
return 0;
}