Mai intai trebuie sa te autentifici.
Cod sursa(job #3001743)
Utilizator | Data | 13 martie 2023 21:19:04 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define N 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,rmq[N][20],a[N];
int main()
{
int i,j,lg,x,y,op;
fin>>n>>m;
for(i=1;i<=n;i++) fin>>a[i];
for(i=1;i<=n;i++) rmq[i][0]=a[i];
for(j=1;j<=log2(n);j++)
for(i=1;i+(1<<j)-1<=n;i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
while(m--)
{
fin>>x>>y;
lg=log2(y-x+1);
fout<<min(rmq[x][lg],rmq[y-(1<<lg)+1][lg])<<"\n";
}
return 0;
}