Pagini recente » Cod sursa (job #2737714) | Cod sursa (job #3282747) | Cod sursa (job #951049) | Cod sursa (job #2951379) | Cod sursa (job #886738)
Cod sursa(job #886738)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[100001][17],v[100001],n;
int main()
{
int x,y,m,i,s,min,j,k,p1,p,l;
fin>>n>>m;
l=log2(n);
for (i=1;i<=n;i++) {fin>>v[i]; a[i][0]=v[i];}
for (j=1;j<=l;j++)
{
p=1<<(j-1); p1=1<<j-1;
for (i=1;i+p1<=n;i++)
{
if (a[i][j-1]<a[i+p][j-1]) a[i][j]=a[i][j-1];
else a[i][j]=a[i+p][j-1];
}
}
for (k=1;k<=m;k++)
{
fin>>x>>y;
s=y-x+1;
min=100001;
for (j=l;x<=y;j--)
{
if (s>>j&1)
{
if (a[x][j]<min) min=a[x][j];
x=x+(1<<j);
}
}
fout<<min<<"\n";
}
}