Cod sursa(job #2123738)
| Utilizator | Data | 6 februarie 2018 16:21:09 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <cmath>
using namespace std;
int d[22][100002];
int main()
{
int n,m,i,j,t,q,k,a,b,tt;
ifstream in("rmq.in");
ofstream out("rmq.out");
in>>n>>q;
for(i=1;i<=n;i++)
{
in>>d[0][i];
}
m=log2(n);
k=1;
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
d[i][j]=min(d[i-1][j],d[i-1][j+k]);
}
k*=2;
}
for(i=1;i<=q;i++)
{
in>>a>>b;
t=log2(b-a+1);
tt=pow(2,t);
out<<min(d[t][a],d[t][b-tt+1])<<"\n";
}
return 0;
}
