Pagini recente » Cod sursa (job #539169) | Cod sursa (job #790723) | Cod sursa (job #2618726) | Cod sursa (job #2834658) | Cod sursa (job #222943)
Cod sursa(job #222943)
#include<fstream.h>
#include<math.h>
int a[100002][18],l,lg[100002],v[100002],n,m,i,j,x,y;
int main()
{
ifstream f ("rmq.in");
f>>n>>m;
for (i=1;i<=n;i++)
f>>v[i];
memset(a,100001,sizeof(a));
for (i=1;i<=n;i++)
a[0][i]=v[i];
for (i=1;(1<<i)<=n;i++)
for (j=1;j<=n-(1<<i-1);j++)
if (a[i-1][j]<a[i-1][j+(1<<i-1)])
a[i][j]=a[i-1][j];
else a[i][j]=a[i-1][j+(1<<i-1)];
lg[1]=0;
for (i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
ofstream g("rmq.out");
for (i=1;i<=m;i++)
{
f>>x>>y;
l=lg[y-x+1];
if (a[l][x]<a[l][y-(1<<l)+1]) g<<a[l][x]<<'\n';
else g<<a[l][y-(1<<l)+1]<<'\n';
}
f.close();
g.close();
return 0;
}