Cod sursa(job #1970395)
| Utilizator | Data | 19 aprilie 2017 12:11:57 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
#define nmax 10002
int rmq[18][nmax],n,i;
void creare()
{
int i,j;
for(i=0;(1<<i)<=n;i++)
for(j=1;j+(1<<i)<=n;j++)
rmq[i+1][j]=min(rmq[i][j],rmq[i][j+(1<<(i))]);
}
int main()
{
int q,k,x,y,j;
f>>n>>q;
for(i=1;i<=n;i++)
f>>rmq[0][i];
creare();
for(i=1;i<=q;i++)
{
f>>x>>y;
k=log2(y-x);
g<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
}
return 0;
}
