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