Cod sursa(job #1436378)
Utilizator | Data | 15 mai 2015 20:17:57 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#define dim 100001
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[dim][25],n,m,lg[dim],half,i,j,l,r,k,diff;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>rmq[i][0];
for(i=2;i<dim;i++)
lg[i]=lg[i/2]+1;
for(j=1;(1 << j)<=n;j++)
for(i=1;i+(1 << j)-1<=n;i++)
{
half=i+(1 << (j-1));
rmq[i][j]=min(rmq[i][j-1],rmq[half][j-1]);
}
for(i=1;i<=m;i++)
{
fin>>l>>r;
k=lg[r-l+1];
diff=r-(1 << k)+1;
fout<<min(rmq[l][k],rmq[diff][k])<<'\n';
}
return 0;
}