Cod sursa(job #2263964)
| Utilizator | Data | 19 octombrie 2018 17:12:03 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int d[17][10001],i,j,x,y,k,m,n;
long long p;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>d[0][i];
}
p=1;
for(i=1;i<=log2(n);i++)
{
for(j=1;j<=n-(1<<i)+1;j++)
{
d[i][j]=min(d[i-1][j],d[i-1][j+p]);
}
p=p*2;
}
for(i=1;i<=m;i++)
{
f>>x>>y;
k=log2(y-x);
g<<min(d[k][x],d[k][y-(1<<k)+1])<<'\n';
}
return 0;
}
