Cod sursa(job #2523570)
| Utilizator | Data | 14 ianuarie 2020 13:20:10 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[200002][19];
int m,n;
void update()
{
int p=1;
for(int j=1; j<=log2(n); j++)
{
p*=2;
for(int i=1; i<=n-p/2+1; i++)
{
rmq[i][j]=min(rmq[i][j-1],rmq[i+p/2][j-1]);
}
}
}
int main()
{
int a,b;
fin>>n>>m;
for(int i=1; i<=n; i++)
{
fin>>rmq[i][0];
}
update();
for(int i=0; i<m; i++)
{
fin>>a>>b;int p=log2(b-a+1);
int put=(1<<p);
fout<<min(rmq[a][p],rmq[b-(1<<p)+1][p])<<"\n";
}
return 0;
}
