Mai intai trebuie sa te autentifici.
Cod sursa(job #3212402)
Utilizator | Data | 11 martie 2024 18:12:13 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,y,x,dist;
int rmq[100005][1005];
void rmqq()
{
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]);
}
}
}
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
{
fin>>rmq[i][0];
}
rmqq();
for(i=1; i<=m; i++)
{
fin>>x>>y;
dist=y-x+1;
dist=log(dist);
fout<<min(rmq[x][dist],rmq[y+1-(1<<dist)][dist])<<'\n';
}
return 0;
}