Cod sursa(job #3262007)
| Utilizator | Data | 8 decembrie 2024 11:51:58 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[100002][22];
int n,k,x,y,z;
int main()
{
fin>>n>>z;
for(int i=1;i<=n;i++)
{fin>>x;rmq[i][0]=x;}
for(int j=1;(1<<j)<=n;j++)
{
for(int i=1;i+(1<<j)-1<=n;i++)
rmq[i][j]=min(rmq[i][j-1] , rmq[i+(1<<(j-1))][j-1]);
}
for(int i=1;i<=z;i++)
{
fin>>x>>y;
int k=log2(y-x+1);
fout<<min(rmq[x][k] , rmq[y-(1<<k)+1][k])<<'\n';
}
return 0;
}
